Treffer: An algorithmic approach to edge - Odd graceful labeling of generalized Petersen graph using advanced python programming.

A graph G with p vertices and q edges called an edge odd graceful labeling if there is abijection map f from the edge set of the graph {1, 3,..., 2k−1} such that, when each vertexis assigned the sum of all edges incident to it mod 2k, where k=max (p, q), the resulting vertex labels are distinct. In this paper, we have proved that the Generalized Petersen Graphs are edge odd graceful labeling and Here we discussed and proved using python programming. [ABSTRACT FROM AUTHOR]