References
- Erdos , P. , Graham , R. L. and Szemeredi , E. 1975 . On sparse graphs with dense long paths . Comput. Math.Appl , 1 : 365 – 369 .
- Farrag , A. A. and Dawson , R. J. 1989 . Designing fault-tolerant star networks . Networks , 19 : 707 – 716 .
- Harary , F. 1969 . Graph Theory , Reading : Addison-Wesley .
- Harary , F. and Schwenk , A. J. 1971 . Trees with hamiltonian square . Mathematika , 18 : 138 – 140 .
- Harary , F. and Schwenk , A. J. 1973 . The number of caterpillars . Discrete Math , 6 : 359 – 365 .
- Harary , F. and Hayes , J. P. 1993 . Edge fault tolerance in graphs . Networks , 23 : 135 – 142 .
- Harary F. Hayes J. P. Node fault tolerance in graphs Networks submitted
- Hayes , J. P. 1976 . A graph model for fault-tolerant computer systems . IEEE Trans. Computers , 25 : 876 – 884 .
- Hayes , J. P. 1993 . “ Fault tolerance in graphs and computers ” . In Proceedings of the First Estonian Conference on Graphs and Applications Edited by: Kilp , M. and Nummert , U. 77 – 89 .
- Kwan , C. and Toida , S. 1982 . An optical 2-FT realization of binary symmetric tree systems . Networks , 12 : 231 – 239 .
- Ku H.-K. Hayes J. P. Edge fault tolerance in multigraphs in preparation
- Wong , W. W. and Wong , C. K. 1984 . Minimum fc-Hamiltonian graphs . J. Graph Theory , 8 : 155 – 165 .
- Paoli , M. , Wong , W. W. and Wong , C. K. 1986 . Minimum /c-Hamiltonian graphs, II . J. Graph Theory , 10 : 79 – 95 .