期刊名称：International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks
印刷版ISSN：0975-7260
电子版ISSN：0975-7031
出版年度：2010
卷号：2
期号：1
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and 1 n− edge is odd graceful, and the cycle graph m C 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 4,6,8,10 m = 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 ( ) m n V C P ∪ and the edge set ( ) m n E C P ∪ .
