Graphs with edge-odd graceful labelings

Solairaju and Chithra [3] introduced a new type of labeling of agraph G with q edges called an edge-odd graceful lebeling if there is abijection 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 incidentto it mod 2q, the resulting vertex labels are distinct. They showed edgeoddgraceful labeling for graphs related to paths. In this paper, graphsrelated to cycles that admitted edge-odd graceful labelings are shown.