Maximal cubic graphs with diameter 4

Discrete Applied Mathematics

Volumn 101, Issue 1-3, 2000, Pages 53-61

  Buset, Dominique ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

05C35; Diameter 4; Maximal cubic graphs; Vertices

Indexed keywords

EID: 0347304335     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00204-8     Document Type: Article

References (18)

1. Bannai E., Ito T. On finite Moore graphs. J. Fac. Sci. Univ. Tokyo. 20:1973;191-208.
2. Bannai E., Ito T. Regular graphs with excess one. Discrete Math. 37:1981;147-158.
3. J.-C. Bermond, B. Bollobás, Diameters in graphs - a survey, in: Proceedings of the 12th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, 1981; Congr. Numer. 32 (1981) 3-27.
4. J.-C. Bermond, B. Bollobás, Diameters in graphs - a survey, in: Proceedings of the 12th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, 1981; Congr. Numer. 32 (1981) 3-27.
5. Bermond J.-C., Delorme C., Farhi G. Large graphs with given degree and diameter II. J. Combin. Theory Ser. B. 36:1984;32-48.
6. Bermond J.-C., Delorme C., Farhi G. Large graphs with given degree and diameter III, in: Proceedings of Coll. Cambridge 1981. Ann. Discrete Math. 13:1982;23-32.
7. Bermond J.-C., Delorme C., Quisquater J.-J. Strategies for interconnection networks: some methods from graph theory. J. Parallel Distrib. Comput. 3:1986;433-449.
8. Bermond J.-C., Delorme C., Quisquater J.-J. Table of large. (Δ,D) graphs Discrete Appl. Math. 37 / 38:1992;575-577.
9. N.L. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, 1974.
10. D. Buset, Quelques conditions locales et extrémales en théorie des graphes, Ph.D. Thesis, Université Libre de Bruxelles, December 1997.
11. Damerell R. On Moore graphs. Proc. Cambridge Philos. Soc. 43:1973;459-474.
12. Delorme C. Grands graphes de degré et diamètre donnés. European J. Combin. 6:1985;291-302.
13. K.W. Doty, Large regular interconnection networks, Proceedings of the Third International Conference on Distributed Computing Systems, IEEE Press, Miami, 1982, pp. 312-317.
14. B. Elspas, Topological constraints on interconnection limited logic, in: Proceedings of the Fifth Symposium on Switching Circuit Theory and Logical Design, Vol. 5-164, IEEE Press, New York, 1964, pp. 133-147.
15. Hoffman A.J., Singleton R.R. On Moore graphs with diameter 2 or 3. IBM J. Res. Develop. 4:1960;497-504.
16. Jørgensen L.K. Diameters of cubic graphs. Discrete Appl. Math. 37 / 38:1992;347-351.
17. Jørgensen L.K. Non existence of certain cubic graphs with small diameters. Discrete Math. 114:1993;265-273.
18. Von Conta C. Torus and other networks as communication networks with up to some hundred points. IEEE Trans. Comput. C. 32:1983;657-666.