Edge Odd Graceful Labeling of Some Ladder and Path Related Graphs

An edge odd graceful labeling of graph G with p vertices and q edges is a modular technique of edge labeling, introduced bySolairaju and Chithra in 2008 [9]. It is a bijection f from the edge set E(G) of the graph to {1, 3,…, 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. A graph is called an edge odd graceful graph as it admits an edge odd graceful labeling. In this research paper, edge odd graceful labeling of some graphs, obtained from paths and ladders such as triangular ladder graph, alternate triangular belt, slanting ladder and braid graph have been discussed.