GRACEFUL LABELING ALGORITHMS AND COMPLEXITY - A SURVEY
Abstract: Graceful graphs were
first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture
states that every tree has a graceful labeling. Aldred andMcKay and others [6,
15, 20] have used computer programs to show that trees oforder up to 35 are
graceful. Bagga et al. investigated algorithms for generatingall graceful
labelings of certain known classes of graceful graphs, including paths,cycles,
and certain other classes of unicyclic graphs. The data generated by suchalgorithms
has led to the discovery of new properties of such graceful labelings. Inthis
paper we present a survey of graceful graph labeling algorithms and related complexity
issues.
Author: S. Arumugam, Jay Bagga
Journal Code: jpmatematikagg110023
