A simple graph G is a graceful graph if there exists a graceful labeling of the vertices of G. A graph G with e edges has a graceful labeling if there exists an injective function l : V (G) ® {0, 1, …, e} such that |l (x) - l (y)| is distinct and nonzero for all xy Î E (G). If we cannot gracefully label the vertices of G, then G is a non-graceful graph. Graceful labeling is one of the best known labeling methods of graphs. In this work, We will try to give some of the Applications of graceful labeling in balanced graphs.