Date of Defense
4-26-2024
Date of Graduation
4-2024
Department
Mathematics
First Advisor
Ping Zhang
Second Advisor
Clifton E. Ealy, Jr.
Abstract
A graph is toroidal if it can be embedded on a torus which is a doughnut-shaped surface. Two well-known examples of toroidal graphs are the complete graph K5 and the complete bipartite graph K3,3. In this thesis we elucidate the association of the subject matter with two renowned enigmas in graph theory, namely the Five Princes Problem and the Three Utilities Problems. Additionally, we look at their association with several renowned theorems in topological graph theory. We explore the link between these two graphs and a contemporary labeling concept.
Recommended Citation
Gulgulia, Akshat, "A Tale of Two Toroidal Graphs" (2024). Honors Theses. 3859.
https://scholarworks.wmich.edu/honors_theses/3859
Access Setting
Honors Thesis-Open Access