New classes of graceful spiders and related computational results

Cardinal Scholar

Show simple item record

dc.contributor.advisor Bagga, Jay
dc.contributor.author Patterson, Brandon
dc.date.accessioned 2017-05-09T18:25:44Z
dc.date.available 2017-05-09T18:25:44Z
dc.date.issued 2017-05-06
dc.identifier.uri http://cardinalscholar.bsu.edu/handle/123456789/200720
dc.description.abstract The conjecture that all trees are graceful is one of the most famous open problems in graph theory. This thesis focuses on the class of spider graphs, a subclass of trees that has thus far not been proven to be universally graceful. We present classes of spiders already known to be graceful, explore methods for extending graceful graphs, and apply these methods to create new classes of graceful spiders. Additionally, we generate all possible graceful labelings for spiders of order 16 or less, and explore properties of these labelings, offering several conjectures and minor results relating to the graceful labeling of spiders. en_US
dc.description.sponsorship Department of Computer Science
dc.subject.lcsh Trees (Graph theory) -- Computer programs.
dc.subject.lcsh Graph labelings -- Computer programs.
dc.title New classes of graceful spiders and related computational results en_US
dc.description.degree Thesis (M.S.) en_US
dc.identifier.cardcat-url http://liblink.bsu.edu/uhtbin/catkey/1852404


Files in this item

This item appears in the following Collection(s)

  • Master's Theses [5256]
    Master's theses submitted to the Graduate School by Ball State University master's degree candidates in partial fulfillment of degree requirements.

Show simple item record

Search Cardinal Scholar


Browse

My Account