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.