Abstract

A distance antimagic labeling of a graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is a bijection from vertex set $V(G)$ to $\{1,2,...,|V(G)|\}$ such that $\displaystyle\sum_{p\in N(q)} f(p)=w(q)$ for all $q\in V(G)$, where $N(q)$ is the set of all vertices of $V(G)$ which are adjacent to $q$ and $w(p)\neq w(q)$ for every pair of vertices $p, q\in V(G)$. A graph which admits a distance antimagic labeling is called a distance antimagic graph. In this paper, we addresses distance antimagic labeling of some specific pancyclic graphs.

Keywords and Phrases

Distance antimagic labeling, pancyclic graph.

A.M.S. subject classification

05C78.

.....