Abstract

AbstractFor an integer , the ‐connectivity of a graph is defined to be the minimum number of vertices of whose removal produces a disconnected graph with at least components or a graph with fewer than vertices. The ‐edge‐connectivity of a graph is the minimum number of edges whose removal leaves a graph with at least components if , and if . Given integers and , we investigate and when . Furthermore, our arguments can be used to show that in the random graph process, the hitting times of minimum degree at least and of ‐connectivity (or ‐edge‐connectivity) at least coincide with high probability. These results generalize the work of Bollobás and Thomason on classical connectivity.

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 call

Disclaimer: 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.