ODD GRACEFUL LABELING OF PATH UNION OF CATERPILLARS
A graph G with q edges is said to be odd graceful if there is an injection f from to such that, when each edge xy is assigned the label the resulting edge labels are In 1991, Gnanajothi [3] introduced a labeling method called odd graceful labeling to label the vertices of a graph. In this paper, we prove the odd graceful labeling of path union of caterpillars.
odd graceful labeling, path, caterpillar graph.
