Publications

Abstract : A distance magic labeling of a graph G on p vertices is a bijection l from the vertex set of G to {1, 2, ···, p} such that for any vertex x of G, the weight of x, wG(x) = ∑v ∈ NG(x) l(v) is a constant. Further, if the weights of vertices of the graph G are in an arithmetic progression of the form a, a + d, …, a + (p – 1)d, then l is an (a, d)-distance antimagic labeling of the graph G. In this paper, we provide a partial solution to the problem on (a, d)-distance antimagicness of disconnected two regular graphs posted by Arumugam and Kamatchi [7].