IEEE Transactions on Computers · 1994 · 336 citations · 7 references
ComputingComputer EngineeringComputer ScienceFault-tolerant ComputingFault-tolerant SystemsParallel ComputingGraph AlgorithmsGraph TheoryNetwork Fault ToleranceConnectivity AlgorithmsGraph ConnectivityGraph Connectivity MeasuresGraph-based Connectivity AnalysisGraph-based Connectivity ModelsMinimal SetsNode ConnectivityVertex Connectivity
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
7
Charles L. Seitz · Communications of the ACM · 1985 · 1.2K citations · Full text
Frank Harary · Networks · 1983 · 433 citations