Journal of the Indonesian Mathematical Society has been acreditated by the General Directorate of Higher Education (DIKTI)
GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY
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.
- There are currently no refbacks.
Journal of the Indonesian Mathematical Society ( p-ISSN:2086-8952 | e-ISSN:2460-0245) published by the Indonesian Mathematical Society (IndoMS).
Visitor Number : View My Stats
Journal of the Indonesian Mathematical Society by http://jims-a.org/index.php/jimsa is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.