Cordial and Mean Labelings on Extended Duplicate Graph of Comb Graph
K. Sutha, K. Thirusangu, S. Bala
Current Journal of Applied Science and Technology · pp. 1–13 · Published 6 Dec 2016
10.9734/BJAST/2016/29134Abstract
A graph labeling is a mapping that carries a set of graph elements onto a set of numbers called labels (usually the set of integers). In this paper we prove the existence of graph labeling such as cordial, total cordial, product cordial, total product cordial, prime cordial, odd mean labeling and even mean labeling for extended duplicate graph of Comb graph by presenting algorithms.
Cited by 2
G. Rajini Ram, S. Hemalatha, K. Anitha · AIP Conference Proceedings · 2020
Showing 1 of 2 known citations — external sources report more than can currently be individually listed.
Related research
- Some E-Cordial Labelings on Extended Duplicate Graph of Comb Graph — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
2
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.