Abstract
Let G be a connected graph and g a non-negative integer, the g-extra connectivity of G is the minimum cardinality of a set of vertices in G, if it exists, whose deletion disconnects G and leaves each remaining component with more than g vertices. In several recent publications, the g-extra connectivity of an n-dimensional folded hypercube was determined for g≤3 and some specific n (see, for example, Chang, Tsai, and Hsieh (2014) [4]). In this paper, an extension of the above results to all 0≤g≤n+1 and n≥7 is presented.
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.
