Extraconnectivity of k-ary n-cube networks

Given a graph G and a non-negative integer g, the g-extraconnectivity of G is the minimum cardinality of a set of vertices in G, if such a set exists, whose deletion disconnects G and leaves every remaining component with more than g vertices. This study shows that the 2-extraconnectivity of a k-ary n-cube for k≥4 and n≥5 is equal to 6n−5.