GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY
Journal of the Indonesian Mathematical Society · 2012
DOI: 10.22342/jims.0.0.14.1-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the Indonesian Mathematical Society, 2012. Verfasst von S. Arumugam und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful labeling. Aldred and McKay and others have used computer programs to show that trees of order up to 35 are graceful. Bagga et al. investigated algorithms for generating all graceful labelings of certain known classes of graceful graphs, including paths, cycles, and certain other classes of unicyclic graphs. The data generated by such algorithms has led to the discovery of new properties of such graceful labelings. In this paper we present a survey of graceful graph labeling algorithms and related complexity issues. DOI : http://dx.doi.org/10.22342/jims.0.0.14.1-9
Zitieren
APA
Arumugam, S., & Bagga, J. (2012). GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY. Journal of the Indonesian Mathematical Society. https://doi.org/10.22342/jims.0.0.14.1-9
Vancouver
Arumugam S, Bagga J. GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY. Journal of the Indonesian Mathematical Society. 2012. doi:10.22342/jims.0.0.14.1-9
BibTeX
@article{Arumugam2012,
author = {Arumugam, S. and Bagga, Jay},
title = {GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY},
journal = {Journal of the Indonesian Mathematical Society},
year = {2012},
doi = {10.22342/jims.0.0.14.1-9}
}
EUVIMED