Subtract Divisor Cordial Labeling
J.T. Gondalia1, A.H. Rokad2
1J.T. Gondalia, Research Scholar, RK University, Rajkot, Gujarat, India.
2A.H. Rokad, Department of Mathematics, School of Engineering, RK University, Rajkot, Gujarat, India.
Manuscript received on 08 April 2019 | Revised Manuscript received on 15 April 2019 | Manuscript Published on 26 July 2019 | PP: 541-545 | Volume-8 Issue-6S4 April 2019 | Retrieval Number: F11120486S419/19©BEIESP | DOI: 10.35940/ijitee.F1112.0486S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Wheel, Helm, Flower, Star Graph.
Scope of the Article: Classification