Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)
View/ Open
Author
Sears, Lewis N., IV (Lew)
Subject
Washington and Lee University -- Honors in Mathematics
Graph theory
Graph connectivity
Metadata
Show full item recordDescription
Thesis; [FULL-TEXT FREELY AVAILABLE ONLINE] Lewis N. Sears is a member of the Class of 2016 of Washington and Lee University. This is the fourth and nal
thesis that concludes ProfessorWayne M. Dymacek's research project Realizability
of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity,
Minimum Degree, and Maximum Degree. With the completion of this project,
working through hundreds of cases, Professor Dymacek's students have successfully
completed an exhaustive system to determine the realizability of any given
parameters and produce these simple and undirected graphs for any possible
order that is desired. [From Conclusion] Lewis Sears IV