Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Journal of the Indonesian Mathematical Society
Jay Bagga
Ball State University
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY Arumugam, S.; Bagga, Jay
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.14.1-9

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 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
Co-Authors S. Arumugam