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 (780.4Kb)
    Author
    Bethea, Candace A.
    Subject
    Washington and Lee University -- Honors in Mathematics
    Graph connectivity
    Graph theory
    Harary, Frank
    Metadata
    Show full item record
    Description
    Thesis; [FULL-TEXT RESTRICTED TO WASHINGTON AND LEE UNIVERSITY LOGIN]
     
    Candace A. Bethea is a member of the Class of 2015 of Washington and Lee University.
     
    Our work continues a long tradition in graph theory studying the relation- ship between vertex connectivity, edge connectivity, and minimum degree. [From Introduction]
     
    Candace Bethea
     
    URI
    http://hdl.handle.net/11021/32170
    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