In 1991, Gnanajothi [4] proved that the path graph Pn with n vertex and n -1edge is odd graceful, and the cycle graph Cm with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd....
moreIn 1991, Gnanajothi [4] proved that the path graph Pn with n vertex and n -1edge is odd graceful, and the cycle graph Cm with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph m n C ÈP when m = 4, 6,8,10 and then we proved that the graph m n C ÈP is odd graceful if m is even. Finally, we described an algorithm to label the vertices and the edges of the vertex set ( ) V CmÈPn and the edge set ( ) E CmÈPn .
