On distance magic labeling of graphs

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.