Solairaju and Chithra [2] presented the concept of edge odd graceful labeling (EOGL) for finite simple graphs. A graph is said to be EOGL if such a labeling exists a bijective mapping a function f from edge set to the set of odd integers from 1 to (2k – 1) so that every vertex is allocated, the total of the labeled edges incident to it mod 2k, are distinct. Here k is the maximum value among p vertices and q edges. The existence of EOGL for Family of Petersen graphs is shown in this work.