Some applications of graceful labelling

Author & Affiliation:
R. Vikrama Prasad (vikramprasad20@gmail.com
Research Scholar, Vinayaka Mission Universtiy & Lecturer, Sona College of technology, Salem - 630 005 (Tamilnadu) INDIA
R. Sattanathan
Reader and Head, P.G. Research Dept. of Mathematics, D.G. Vaishnav College, Ambakkam, Chennai 600 106 (Tamilnadu) INDIA
Keyword:
graceful labeling, graceful graph, balanced graph.
Issue Date:
April 2010
Abstract:

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.
 

Pages:
115-122
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
DOI:
jusps-A
Share This:
Facebook Twitter Google Plus LinkedIn Reddit

Copy the following to cite this article:

R. V. Prasad; R. Sattanathan, "Some applications of graceful labelling ", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 115-122, 2018

Copy the following to cite this URL:

R. V. Prasad; R. Sattanathan, "Some applications of graceful labelling ", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 115-122, 2018

Available from: https://www.ultrascientist.org/paper/1034/

Ansari Education And Research Society
Facebook Google Plus Twitter