Abstract
The super-connectivity (super-edge-connectivity) of a connected graph G is the minimum number of vertices (edges) that need to be deleted from G in order to disconnect G without creating isolated vertices. We determine when the generalized Petersen graphs GP[n,k] are super-connected and super edge-connected, and show that their super-connectivity and their super-edge-connectivity are both equal to four when n∉{2k,3k}. These results partially answer a question by Harary (1983) and are of interest especially in the study of reliability and fault tolerance of interconnection networks, since the graphs in this class are good candidates for such networks.
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.
