A labeling or numbering of a graph G is an assignment of labels to the vertices of G that induces for each edge uv a labeling depending on the vertex labels f(u) and f(v). In this paper, we study the odd graceful labeling on two classes of graphs such as Roman rings having cycle with 6 vertices and hanging complete bipartite graphs.