Abstract
The l -connectivity ϰ/( G) of a graph G of order p ⩾ l − 1 is the minimum number of vertices that are required to be deleted from G to produce a graph with at least l components or with fewer than l vertices. Extremal graphs are investigated and bounds established on the number of edges in graphs of given order and l -connectivity.
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.
