Abstract
Abstract The vertex connectivity, k(g), of a graph g is the minimum number of vertices whose removal from g results in either a disconnected or a trivial graph. Edge connectivity, k'(g), has an analogous definition with edges replacing vertices in the previous definition. A well known result of H. Whitney provides a comparison between the two connectivities and the minimum vertex degree of a graph.
Sign-in/Register to access full text options 
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.
