On g-extra connectivity of folded hypercubes

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. (C) 2015 Elsevier B.V. All rights reserved.