THE DISTANCE MAGIC INDEX OF A GRAPH
No Thumbnail Available
Date
2018
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Discussiones Mathematicae Graph Theory 38 (2018) 135–142
Abstract
Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection φ : V (G) → S satisfying P x∈N(u) φ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}. Let i(G) = min α(S), where the minimum is taken over all sets S for which the graph G admits an S-magic labeling. Then i(G) − n is called the distance magic index of the graph G. In this paper we determine the distance magic index of trees and complete bipartite graphs.
Description
Keywords
Citation
Godinho, A., Singh, T., & Arumugam, S. (2017). The distance magic index of a graph. Discussiones Mathematicae Graph Theory, 38(1), 135-142.