Total Neighborhood Magic Labeling for Complete Graph, Path and C_n?K_1

N P Shrimali¹ , Y M Parmar² , M A Patel³

1. Dept. of Mathematics, Gujarat University, Ahmedabad, India.
2. Dept. of Mathematics, Government Engineering College, Gandhinagar, India.
3. Dept. of Mathematics, Government Engineering College, Gandhinagar, India.

Section:Research Paper, Product Type: Journal-Paper
Vol.11 , Issue.3 , pp.1-5, Jun-2024

Online published on Jun 30, 2024

Copyright © N P Shrimali, Y M Parmar, M A Patel . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

7 Views    20 Downloads    3 Downloads

Abstract :
— A bijection f:V(G)? E(G)? {1,2,…,|V(G)? E(G)|} is a total neighborhood magic labeling on a graph G with vertices n and edges e such that ?_(v?N(u))??(f(v) ?+f(uv))=k, ? u?V(G), where N(u) is the set of all adjacent vertices of u in V(G). Here k is the magic constant of total neighborhood magic graph and graph G is known as a total neighborhood magic graph. In this paper, we examine a total neighborhood magic labeling for complete graph with odd vertices, path and corona product between C_(n )& K_1.

Key-Words / Index Term :
Complete graph, path, corona product, total neighborhood magic labeling

References :
[1] J. Gross and J. Yellen, “Graph Theory and its Applications”, CRC Press, 2005.
[2] D. M. Burton, “Elementary Number Theory”, Tata McGrow-Hill, 2007.
[3] J. A. Gallian, “A dynamic survey of graph labeling”, The Electronic Journal of Combinatorics, Vol.26, #DS6, 2023.
[4] M. Miller, C. Rodger and R. Simanjuntak, “Distance magic labeling of graphs”, Australasian Journal of Combinatorics, Vol.28, pp.305-315, 2003.
[5] K. A. Sugeng, D. Fronc ?ek, M. Miller, J. Ryan and J. Walker, “On distance magic labeling of graphs”, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol.71, pp.39-48, 2009.
[6] V. Vilfred, “??-labelled graphs and circulant graphs”, Ph.D. thesis, University of Kerala, Trivandrum, India, 1994.
[7] B. D. Acharya, S. B. Rao, T. Singh and V. Parameswaran, “Neighborhood magic graphs”, National Conference on Graph Theory, Combinatorics and Algorithm, 2004.
[8] N. P. Shrimali and Y. M. Parmar, “Total Neighborhood Magic Labeling: A New Variant of Magic Labeling”, Turkish Journal of Computer and Mathematics Education, Vol.12, Issue.13, pp.6693-6702, 2021
[9] R. L. Graham and N. J. A. Sloane, “On additive basis and harmonious graphs”, SIAM Journal of Algebraic and Discrete Methods, Vol.1, pp.382-404, 1980.
[10] H. K. Krishnappa, K. Kothapalli and V. CH. Venkaiah, “Vertex magic total labeling of complete graphs”, AKCE Journal of Graphs and Combinatorics, Vol.6, Issue.1, pp.143-154, 2009.