Further results on distance magic labeling of graphs
Abstract
Let G=G(V, E) be a graph. If for each vertex v, sum of the labeling of the vertices which are at a distance D from v is constant, then such a labeling is said to be D-distance magic labeling and a graph G is said to be D-distance magic graph. In this paper, we study D-distance magic labeling of cycles, complete multipartite graphs, and star graphs. Also we obtain necessary and sufficient conditions for trees, n-star and join of two graphs to admit a distance magic labeling.
Copyright © 2021 K. Chaithra, P. Shankaran. 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.
Cite this article
K. Chaithra, P. Shankaran, Further results on distance magic labeling of graphs, J. Math. Comput. Sci. 11 (2021), 1133–1144. https://doi.org/10.28919/jmcs/5096
BibTeX
@article{Chaithra2021,
author = {Chaithra, K. and Shankaran, P.},
title = {Further results on distance magic labeling of graphs},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {1133--1144},
doi = {10.28919/jmcs/5096}
}