Zumkeller Labeling of Complete Graphs
B. J. Balamurugan1, R. Madura Meenakshi2
1B .J. Balamurugan, Department of Advanced Sciences, VIT University, Chennai Campus, Chennai (Tamil Nadu), India.
2R. Madura Meenakshi, Research Scholar, SSN College of Engineering, Kalavakkam (Tamil Nadu), India.
Manuscript received on 16 December 2019 | Revised Manuscript received on 23 December 2019 | Manuscript Published on 31 December 2019 | PP: 352-355 | Volume-9 Issue-1S3 December 2019 | Retrieval Number: A10661291S319/19©BEIESP | DOI: 10.35940/ijeat.A1066.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: Let G (V, E) be a graph with vertex set V and edge set E. The process of assigning natural numbers to the vertices of G such that the product of the numbers of adjacent vertices of G is a Zumkeller number on the edges of G is known as Zumkeller labeling of G. This can be achieved by defining an appropriate vertex function of G. In this article, we show the existence of this labeling to complete graph and fan graph.
Keywords: Zumkeller Number, Labeling, Injective Function and Complete Graph, Fan Graph.
Scope of the Article: Graph Algorithms and Graph Drawing