Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)

Abstract

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]