Topological graph theory and graphs of positive combinatorial curvature
Document
Item Description
Linked Agent
Creator (cre): Childs, Marissa L.
Advisor (adv): Balof, Barry
Department (dpt): Whitman College. Mathematics Department
Date
May 11, 2016
Graduation Year
2016
Abstract
This thesis considers the open problem in topological graph theory: What is the largest connected graph of minimum degree 3 which has everywhere positive combinatorial curvature but is not in one of the infinite families of graphs of positive combinatorial curvature? This problem involves the generalization of the notion of curvature (a geometric concept) to graphs (a combinatorial structure). The thesis presents past progress on the upper and lower bounds for this problem as well as graph operations that may be used in the future for improving the lower bound.
Subject
Genre
Extent
46 pages
Permanent URL
Contact Us
If you have questions about permitted uses of this content, please contact the Arminda administrator: http://works.whitman.edu/contact-arminda