TY - JOUR
T1 - On distance magic labeling of graphs
AU - Sugeng, K. A.
AU - Fronček, D.
AU - Miller, M.
AU - Ryan, J.
AU - Walker, J.
PY - 2009/11
Y1 - 2009/11
N2 - Distance magic labeling of a graph of order n is a bijection f : V → {1,2,... ,n] with the property that there is a positive integer constant k such that for any vertex x, ΣyεN(x)f(y) = k, where N(x) is the set of vertices adjacent to x. In this paper, we prove new results about the distance magicness of graphs that have minimum degree one or two. Moreover, we construct distance magic labeling for an infinite family of non-regular graphs.
AB - Distance magic labeling of a graph of order n is a bijection f : V → {1,2,... ,n] with the property that there is a positive integer constant k such that for any vertex x, ΣyεN(x)f(y) = k, where N(x) is the set of vertices adjacent to x. In this paper, we prove new results about the distance magicness of graphs that have minimum degree one or two. Moreover, we construct distance magic labeling for an infinite family of non-regular graphs.
UR - http://www.scopus.com/inward/record.url?scp=78651535849&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651535849&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:78651535849
SN - 0835-3026
VL - 71
SP - 39
EP - 48
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
ER -