Washington and Lee University Library
    • Login
    View Item 
    •   Digital Archive Home
    • W&L University Student Scholarship
    • W&L Dept. of Mathematics
    • View Item
    •   Digital Archive Home
    • W&L University Student Scholarship
    • W&L Dept. of Mathematics
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

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

    Thumbnail
    View/Open
    Honors thesis (410.2Kb)
    Author
    Sears, Lewis N., IV (Lew)
    Subject
    Washington and Lee University -- Honors in Mathematics
    Graph theory
    Graph connectivity
    Metadata
    Show full item record
    Description
    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
     
    URI
    http://hdl.handle.net/11021/33566
    Collections
    • W&L Dept. of Mathematics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of the Digital ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV