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.>
No takes yet. Share an insight, caveat, or question.
Latifi et al. (1994) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: