Some applications of graceful labelling

eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences April 2010 22 1 115 122 jusps-A 1034 article Some applications of graceful labelling R. Vikrama Prasad (vikramprasad20@gmail.com 1 R. Sattanathan 2 Research Scholar, Vinayaka Mission Universtiy & Lecturer, Sona College of technology, Salem - 630 005 (Tamilnadu) INDIA Reader and Head, P.G. Research Dept. of Mathematics, D.G. Vaishnav College, Ambakkam, Chennai 600 106 (Tamilnadu) INDIA 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.   https://www.ultrascientist.org/paper/1034/ graceful labeling graceful graph balanced graph.