Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1709545 | Applied Mathematics Letters | 2009 | 5 Pages |
Abstract
Given a graph GG and a non-negative integer g, the g -extraconnectivity of GG (written κg(G)κg(G)) is the minimum cardinality of a set of vertices of GG, if it exists, whose deletion disconnects GG, and where every remaining component has more than gg vertices. The usual connectivity and superconnectivity of GG correspond to κ0(G)κ0(G) and κ1(G)κ1(G), respectively. In this work, we determine κg(Qn)κg(Qn) for 0≤g≤n0≤g≤n, n≥4n≥4, where QnQn denotes the nn-dimensional hypercube.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Weihua Yang, Jixiang Meng,