Title
Conditional Connectivity Measures for Large Multiprocessor Systems
Document Type
Article
Publication Date
1-1-1994
Abstract
We introduce 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. © 1994 IEEE
Publication Source (Journal or Book title)
IEEE Transactions on Computers
First Page
218
Last Page
222
Recommended Citation
Latifi, S., Hegde, M., & Naraghi-Pour, M. (1994). Conditional Connectivity Measures for Large Multiprocessor Systems. IEEE Transactions on Computers, 43 (2), 218-222. https://doi.org/10.1109/12.262126
COinS