Open AccessSubtract Divisor Cordial Labeling
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.f1112.0486s419
Subject(s) - divisor (algebraic geometry) , graph , mathematics , combinatorics , bijection , edge graceful labeling , graph labeling , line graph , graph power
A subtract divisor cordial labeling is bijection r: Z (G+ ) → {1,2,…,|V(G+ )|} in such a way that an edge uv give the label 1 if r(u) - r(v) is divisible by 2 otherwise give the label 0, then absolute difference of number of edges having label 1 and 0 is at most 1. A graph which fulfill the condition of subtract divisor cordial labeling is called subtract divisor cordial graph. In given paper, we found ten new graphs satisfying the condition of subtract divisor cordial labeling. AMS Subject classification number: 05C78