Conditional connectivity measures for large multiprocessor systems
Seyed Milad Mir Latifi, M.V. Hegde, Mort Naraghi‐Pour · IEEE Transactions on Computers · 1994
Introduces a new measure of conditional connectivity for large regular graphs by requiring each vertex to have at least g good neighbors in the graph. Based on this requirement, the vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized.>