Given a simple connected undirected graph G and a labeling f from the set of its vertices to the set of first odd integers from 1 up to n, where n is the number of vertices of G. The function f is called a graceful labeling on G if the weights of any two different edges are not the same, where the weight of an edge is defined as the absolute value of the difference of the labels of its two end vertices. A graph is said to be a graceful graph if it admits a graceful labeling. In this paper, we show that there are some new classes of graphs that are graceful.

labeling, graceful labeling, graceful graphs.