Conditional connectivity measures for large multiprocessor systems
- 1 February 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 43 (2), 218-222
- https://doi.org/10.1109/12.262126
Abstract
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.<>Keywords
This publication has 7 references indexed in Scilit:
- Combinatorial analysis of the fault-diameter of the n-cubeIEEE Transactions on Computers, 1993
- Network resilience: a measure of network fault toleranceIEEE Transactions on Computers, 1990
- Generalized measures of fault tolerance with application to N-cube networksIEEE Transactions on Computers, 1989
- On computing a conditional edge-connectivity of a graphInformation Processing Letters, 1988
- The cosmic cubeCommunications of the ACM, 1985
- Conditional connectivityNetworks, 1983
- Graph Theory with ApplicationsPublished by Springer Science and Business Media LLC ,1976