Further results on distance magic labeling of graphs

K. Chaithra, P. Shankaran

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.


Full Text: PDF

Published: 2021-01-27

How to Cite this Article:

K. Chaithra, P. Shankaran, Further results on distance magic labeling of graphs, J. Math. Comput. Sci., 11 (2021), 1133-1144

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.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2021 JMCS