Smallest Regular Graphs of Given Degree and Diameter
Discussiones Mathematicae Graph Theory (2014)
- Volume: 34, Issue: 1, page 187-191
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] E. Bannai and T. Ito, On finite Moore graphs, J. Fac. Sci. Tokyo Univ. 20 (1973) 191-208. Zbl0275.05121
- [2] E. Bannai and T. Ito, Regular graphs with excess one, Discrete Math. 37 (1981) 147-158. doi:10.1016/0012-365X(81)90215-6[Crossref]
- [3] R.M. Damerell, On Moore graphs, Proc. Cambridge Philos. Soc. 74 (1973) 227-236. doi:10.1017/S0305004100048015[Crossref] Zbl0262.05132
- [4] P. Erdös, S. Fajtlowicz and A.J. Hoffman, Maximum degree in graphs of diameter 2, Networks 10 (1980) 87-90. doi:10.1002/net.3230100109 Zbl0427.05042
- [5] A.J. Hoffman and R.R. Singleton, On Moore graphs with diameter 2 and 3, IBM J. Res. Develop. 4 (1960) 497-504. doi:10.1147/rd.45.0497[Crossref] Zbl0096.38102
- [6] M. Knor and J. Širáň, Smallest vertex-transitive graphs of given degree and diameter, J. Graph Theory, (to appear).[WoS] Zbl1280.05066
- [7] M. Miller and J. Širáň, Moore graphs and beyond: A survey of the degree-diameter problem, Electron. J. Combin., Dynamic survey No. D14 (2005), 61pp. Zbl1079.05043