1. 1. J.C. Bermond, J. Bond, M. Paoli, and C. Peyrat, 1983 . Graphs and interconnection networks: Diameter and vulnerability. In Proc. Ninth British Combinatorial Conference. London Mathematical Society, Lecture Note Series 82: 1 -30 .
2. Strategies for interconnection networks: Some methods from graph theory
3. 3. J.C. Bermond, N. Homobono, and C. Peyrat. 1986 . Large fault tolerant interconnection networks. In Proc. First Japan International Conference on Graph Theory and Applications, Hakone, Japan; also, accepted for publication in Graphs Comb.
4. 4. J.C. Bermond, F. Comellas, and F. Hsu. 1987 . Distributed loop computer networks: A survey. Preprint.
5. 5. J.C. Bermond, O. Favaron, and M. Maheo. 1988 . Hamiltonian decomposition of Cayley graphs of degree four . J. Comb. Theory, Ser. B.In press;