In this paper, we prove that result on graceful labeling of path and symmetrical trees are graceful graphs. We also prove that result on ϕ-graceful labeling of paths, flower graph, friendship graph. Graph labeling is an active area of research in graph theory. Graph labeling where the vertices are assigned some value subject to certain condition. Labeling of vertices and edges play a vital role in graph theory. To begin with simple, finite, connected and undirected graph G=(V(G),E(G)) with |V(G)|=p and |E(G)|=q. For standard terminology and notation we follow Gallian, Gross and Yellen. The definitions and other information which serve as prerequisites for the present investigation.