Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903456 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A.K. Handa, Aloysius Godinho, T. Singh,