Distance antimagic labeling of the ladder graph
| dc.contributor.author | Godinho, Aloysius | |
| dc.date.accessioned | 2025-05-31T05:52:35Z | |
| dc.date.available | 2025-05-31T05:52:35Z | |
| dc.date.issued | 2017 | |
| dc.description.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 ∼= P2Pn. | |
| dc.identifier.uri | http://rcca.ndl.gov.in/handle/123456789/239 | |
| dc.language.iso | en | |
| dc.publisher | Electronic Notes in Discrete Mathematics 63 (2017) 317–322 | |
| dc.title | Distance antimagic labeling of the ladder graph | |
| dc.type | Article |