We introduce a new measure of conditional. connectivity for large regu
lar graphs by requiring each vertex to have at least g good neighbors
in the graph. Based on this requirement, the vertex connectivity for t
he n-dimensional cube is obtained, and the minimal sets of faulty node
s that disconnect the cube are characterized.