Abstract
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally k-connected/k-edge-connected graphs. We give an overview of the results known for finite graphs and show that most of these carry over to infinite graphs if we consider ends of small degree as well as vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
