Narayana Prime Cordial Labeling of Complete Graph and Complete Bipartite Graph
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 18 December 2019 | Revised Manuscript received on 24 December 2019 | Manuscript Published on 31 December 2019 | PP: 360-365 | Volume-9 Issue-1S3 December 2019 | Retrieval Number: A10681291S319/19©BEIESP | DOI: 10.35940/ijeat.A1068.1291S319
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: Complete bipartite graph and complete graph are very important graphs and they find vital applications in the field of computer science. In this paper we compute the labels 0 and 1 to the edges of these graphs by satisfying the cordiality condition using prime numbers and Narayana numbers. We use divisibility concepts while computing the NP-cordial graphs.
Keywords: Narayana Numbers, Prime Numbers, NP Cordial Graph.
Scope of the Article: Cryptography and Applied Mathematics