Graphs with edge-odd graceful labelings
Sirirat Singhun · International Mathematical Forum · 2013
Solairaju and Chithra [3] introduced a new type of labeling of a graph G with q edges called an edge-odd graceful lebeling if there is a bijection f from the edges of the graph to the set {1, 3, 5, . . . , 2q − 1} such that, when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting vertex labels are distinct. They showed edgeodd graceful labeling for graphs related to paths. In this paper, graphs related to cycles that admitted edge-odd graceful labelings are shown.