Narayana Prime Cordial Labeling of Cycle Related and Tree Related Graphs
S Venkatesh1, B J Balamurugan2
1S Venkatesh*, Mathematics Division, School of Advanced Sciences, VIT, Chennai, Tamil Nadu, India.
2B J Balamurugan, Mathematics Division, School of Advanced Sciences, VIT, Chennai, Tamil Nadu, India.
Manuscript received on January 16, 2020. | Revised Manuscript received on January 24, 2020. | Manuscript published on February 10, 2020. | PP: 3099-3104 | Volume-9 Issue-4, February 2020. | Retrieval Number: D2065029420/2020©BEIESP | DOI: 10.35940/ijitee.D2065.029420
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: The Narayana prime cordial labeling of a graph G (U , E) is a process of assigning the binary numbers 0 and 1 to the edges satisfying the cordiality condition through a 1-1 function on U and an induced function on E. In this manuscript, we compute this labeling to certain cycle related graphs and tree related graphs viz. (i) ladder graph, (ii) wheel graph, (iii) fan graph, (iv) double star graph, (v) bistar graph and (vi) generalized star graph.
Keywords: NP-Cordial Graphs, Prime Numbers, Narayana Numbers.
Scope of the Article: Graph Algorithms And Graph Drawing