Abstract
A g-extra cut of a non-complete graph G,g≥0, is a set of vertices in G whose removal disconnects the graph, while every component in the survival graph contains at least g+1 vertices. The g-extra connectivity of G then refers to the size of a minimum g-extra cut of G.The augmented hypercube, denoted by AQn,n≥3, is a rich variant of the hypercube structure. In this paper, we present a sequence of construction based upper bounds of its g-extra connectivity, study its lower bound via the super connectedness property, and suggest an asymptotically tight bound.
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.
