References
- Esfahanian , A. H. (1989) . Generalized measures of fault tolerance with application to N-cube networks . IEEE Trans. Computers , 38 ( 11 ) : 1586 – 1591 .
- Barefoot , C. A. , Entringer , R. and Swart , H. (1987) . Vulnerability in graphs—A comparative survey . J. Combinatorial Mathematics and Combinatorial Computing , 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 Architectures Plenum Press
- Harary F. (1969) Graph Theory Addison-Wesley Reading MA
- Yang X. (2003) Fault tolerance of hypercube with forbidden faulty sets In: Proc. 10th Chinese Conf. Fault-Tolerant Computing Peking pp. 135–139
- Armstrong , J. and Gray , F. (1981) . Fault Diagnosis in a Boolean n-cube array of microprocessors . IEEE Trans. Computers , 30 : 587 – 590 .