Abstract

In 2008, Solairaju and Chithra [10] introduced edge-odd graceful labeling. A graph $G$ with $p$ vertices and $q$ edges is called an edge odd graceful graph if there is a bijection $f$ from the edge set of the graph to the set $\{1, 3,\dots, (2q-1)\}$ such that, when each vertex is assigned to the sum of all edges incident to it modulo 2$q$, the resulting vertex labels are distinct. In this paper, we have proved the Jahangir graph $J_{m,n}$ for $m$ = 3 and $n \geq 3$ is edge odd graceful and in general, the Jahangir graph $J_{m,n}$ for $m, n$ is odd, $m \geq 5$ and $n \geq 3$ is also edge odd graceful.

 

Keywords and Phrases

Edge-Odd graceful labeling, Jahangir graph.

A.M.S. subject classification

05C78.

.....