No Detail Found!

On odd graceful labeling of the disjoint union of cycle and h-isomorphic copies of paths.

Author(s)
M. Javaid Department of Mathematics, National University of Computer and Emerging Sciences, Lahore Campus, Pakistan
A. A. Bhatti Department of Mathematics, National University of Computer and Emerging Sciences, Lahore Campus, Pakistan
Abstract
In 1991, Gnanajothi defined odd graceful labeling. She proved that the path graph Pn is odd graceful and the cycle graph Cm is also odd graceful if and only if mis even. In 2010, Ibrahim Moussa proved that the graph Cm U Pn is odd graceful if m is even. He also described an algorithm to label the vertices and edges of the graph Cm U Pn for odd graceful labeling. In this paper, we prove that Cm U h Pn admits odd graceful labeling under certain conditions.
Publication Details
Page(s) 171-173
DOI DOI not available
Published Journal: Science International, Volume: 25, Issue: 2, Year: 2013

Request the full text from PASTIC

0

Citations

0

Downloads

91

Views