Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets

IEEE Transactions on Computers

Volumn 47, Issue 8, 1998, Pages 888-893

  Wu, Jie ^a,b   Guo, Guanghui ^b  

^a IEEE   (United States)

^b Florida Atlantic University   (United States)

Author keywords

Fault tolerance; Forbidden faulty sets; Hypercubes; Minimum vertex cut

Indexed keywords

EID: 0000652549     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.707589     Document Type: Article

References (7)

1. L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 32, no. 4, pp. 323-333, Apr. 1984.
2. F.T. Boesch, "Graph Theory and Reliable Network Synthesis," technical report, Electrical Eng. and Computer Science Dept., Stevens Inst. of Technology, 1986.
3. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications New York: American Elseview, 1976.
4. V. Chvatal, "Tough Graphs and Hamiltonian Circuits," Discrete Math., vol. 5, pp. 215-228, 1973.
5. A.H. Esfahanian, "Generalized Measures of Fault Tolerance with Application to n-Cube Networks," IEEE Trans. Computers, vol. 38, no. 11, pp. 1,586-1,591, Nov. 1989.
6. S. Latifi, M. Hegde, and M. Naraghi-Pour, "Conditional Connectivity Measures for Large Multiprocessor Systems," IEEE Trans. Computers, vol. 43, no. 2, pp. 218-222, Feb. 1994.
7. Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.