The graceful tree conjecture was first introduced over 50 years ago, and to this day it remains largely unresolved. Ideas for how to label arbitrary trees have been sparse, and so most work in this area focuses on demonstrating that particular classes of trees are graceful. In my research, I continue this effort and establish the gracefulness of some new tree types using previously developed techniques for constructing graceful trees. Meanwhile, little work has been done on developing computational methods for obtaining graceful labelings, as direct approaches are computationally infeasible for even moderately large trees. With this in mind, I have designed a new computational approach for constructing a graceful labeling for trees with sufficiently many leaves. This approach leverages information about the local structures present in a given tree in order to construct a suitable labeling. It has been shown to work for many small cases and thoughts on how to extend this approach for larger trees are put forth. / McAnulty College and Graduate School of Liberal Arts; / Computational Mathematics / MS; / Thesis;
| Identifer | oai:union.ndltd.org:DUQUESNE/oai:digital.library.duq.edu:etd/197178 |
| Date | 17 May 2016 |
| Creators | Guyer, Michael |
| Contributors | Karl Wimmer, Rachael Neilan, John Kern |
| Source Sets | Duquesne University |
| Detected Language | English |
| Rights | Worldwide Access; |
Page generated in 0.0154 seconds