An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles

M. Ibrahim Moussa

In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if…