Issue No. 02 - February (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.262126
<p>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.</p>
hypercube networks; multiprocessing systems; fault tolerant computing; conditional connectivity; large regular graphs; vertex connectivity; n-dimensional cube; multiprocessor systems; hypercube.
S. Latifi, M. Hegde and M. Naraghi-Pour, "Conditional Connectivity Measures for Large Multiprocessor Systems," in IEEE Transactions on Computers, vol. 43, no. , pp. 218-222, 1994.