Distance Antimagic Labeling of the Ladder Graph

Let G be a graph of order n. Let f:V(G)→{1,2,…,n} be a bijection. The weight wf(v) of a vertex with respect to f is defined by wf(v)=∑x∈N(v)f(x). The labeling f is said to be distance antimagic if wf(u)≠wf(v) for every pair of vertices u,v∈V(G). If the graph G admits such a labeling then G is said to be a distance antimagic graph. In this paper we investigate the existence of distance antimagic labeling in the ladder graph Ln≅P2□Pn.