1. Diameters of graphs: Old problems and new results;Chung;in: Proc. 18th Southeastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium,1987
2. Edge fault tolerance in graphs;Harary;Networks,1993
3. Node fault tolerance in graphs;Harary;Networks,1996
4. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes;Leighton,1992
5. Fat-trees: Universal networks for hardware-efficient supercomputing;Leiserson;IEEE Trans. Comput.,1985