On the maximal connected component of hypercube with faulty vertices

International Journal of Computer Mathematics

Volumn 81, Issue 5, 2004, Pages 515-525

  Yang, Xiaofan ^a   Evans, David J ^b   Chen, Bill ^c   Megson, Graham M ^d   Lai, Hongjian ^e  

^a CHONGQING UNIVERSITY   (China)

^b NOTTINGHAM TRENT UNIVERSITY   (United Kingdom)

^c NANKAI UNIVERSITY   (China)

^d UNIVERSITY OF READING   (United Kingdom)

^e WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

Fault tolerance; Hypercube; Interconnection network; Maximal connected component

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; PROGRAM PROCESSORS; SET THEORY;

HYPERCUBE; MAXIMAL CONNECTED COMPONENT;

INTERCONNECTION NETWORKS;

EID: 25844443241     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160410001661726     Document Type: Article

References (7)

1. Esfahanian, A. H. (1989). Generalized measures of fault tolerance with application to N-cube networks. IEEE Trans. Computers, 38(11), 1586-1591.
2. Barefoot, C. A., Entringer, R. and Swart, H. (1987). Vulnerability in graphs - A comparative survey. J. Combinatorial Mathematics and Combinatorial Computing, 1, 13-22.
3. Cozzens, M., Moazzami, D. and Stueckle, S. (1995). The tenacity of a graph, In: Y. Alavi and A. Schwenk (Eds.), Graph Theory, Combinatorics, and Applications: Proc. 7th Quadrennial Int'l Conf. Theory and Applications of Graphs, Vol. 2, John Wiley and Sons, New York, pp. 1111-1122.
4. Parhami, B. (1999). An Introduction to Parallel Processing: Algorithms and Architectures, Plenum Press.
5. Harary, F. (1969). Graph Theory, Addison-Wesley, Reading, MA.
6. Yang, X. (2003). Fault tolerance of hypercube with forbidden faulty sets, In: Proc. 10th Chinese Conf. Fault-Tolerant Computing, Peking, pp. 135-139.
7. Armstrong, J. and Gray, F. (1981). Fault Diagnosis in a Boolean n-cube array of microprocessors. IEEE Trans. Computers, 30, 587-590.