On computing a conditional edge-connectivity of a graph
Information Processing Letters
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
| Hi-index | 0.01 |
It is shown that for a given p (math), the n-cube network can tolerate up to p2/sup(n-p)/-1 processor failures and remains connected provided that at most p neighbors of any nonfaulty processor are allowed to fail. This generalizes the result for p=n-1,obtained by A.-M Esfahanian (1989). It is also shown that the n-cube network withn greater than or equal to 5 remains connected provided that at most two neighbors of any processor areallowed to fail.