An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles - Computer Science > Information TheoryReport as inadecuate




An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: In 1991, Gnanajothi 4 proved that the path graph P n with n vertex and n-1edge is odd graceful, and the cycle graph C m with m vertex and m edges is oddgraceful if and only if m even, she proved the cycle graph is not graceful if modd. In this paper, firstly, we studied the graph C m $\cup$ P m when m = 4,6,8,10 and then we proved that the graph C $\cup$ P n is odd graceful if m iseven. Finally, we described an algorithm to label the vertices and the edges ofthe vertex set VC m $\cup$ P n and the edge set EC m $\cup$ P n.



Author: M. Ibrahim Moussa Benha University, Benha, Egypt

Source: https://arxiv.org/







Related documents