Multiply 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, RK University, Rajkot, Gujarat, India.
Manuscript received on November 25, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 1901-1904 | Volume-9 Issue-2, December, 2019. | Retrieval Number: B3181129219/2019©BEIESP | DOI: 10.35940/ijeat.B3181.129219
Open Access | Ethics and Policies | Cite | Mendeley
© 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: A Graph G* having multiply divisor cordial labeling with node set V* is a bijective. t on V * to {1,2,…,V * } such that an edge ab is allocate the label 1 if 2 divides (t (a) t (b)) and 0 otherwise, then the number of edges having label 0 and the number of edges having label 1 differ by maximum 1. A graph having multiply divisor cordial labeling is said to be multiply divisor cordial graph. In this paper, we prove that cycle, cycle having 1 chord, cycle having 2 chords, cycle having triangle, path, jellyfish, coconut tree, star and bistar graph are multiply divisor cordial graphs. Subject classification number: 05C78.
Keywords: Subtract divisor cordial, jellyfish, coconut tree.