References
References
- Esfahanian , AH . (1989) . Generalized measures of fault tolerance with application to N-cube networks . IEEE Trans. Comp. , 38 ( 11 ) : 1586 – 1591 .
- Yang , X , Evans , DJ , Chen , B , Megson , GM and Lai , H . (2004) . On the maximal connected component of hypercube with faulty vertices . Int. J. Comp. Math. , 81 ( 5 ) : 515 – 525 .
- Barefoot , CA , Entringer , R and Swart , H . (1987) . Vulnerability in graphs – A comparative survey . J. Combinatorial Math. Combinatorial Comput. , 1 : 13 – 22 .
- Cozzens M Moazzami D 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 2 John Wiley and Sons New York pp. 1111–1122
- Parhami B (1999) An Introduction to Parallel Processing: Algorithms and Architectures, Plenum Press
- Harary F (1969) Graph Theory, Addison Wesley Reading MA
- Armstrong , J and Gray , F . (1981) . Fault diagnosis in a Boolean n-cube array of microprocessors . IEEE Trans. Comp. , 30 ( 8 ) : 587 – 590 .
- Yang X (2003) Fault tolerance of hypercube with forbidden faulty sets Proc. 10th Chinese Conf. Fault-Tolerant Computing, Peking pp. 135–139
- Yang X Evans DJ Megson GM A generalized connectivity measure for multicomputer systems with application to hypercube Neural, Parallel Scientific Comput. to appear