On Moore graphs
- 1 September 1973
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 74 (2), 227-236
- https://doi.org/10.1017/s0305004100048015
Abstract
In this paper, we shall first describe the theory of distance-regular graphs and then apply it to the classification of Moore graphs. The object of the paper is to prove that there are no Moore graphs (other than polygons) of diameter ≥ 3. An independent proof of this result has been given by Barmai and Ito(1). Taken with the result of (4), this shows that the only possible Moore graphs are the following:Keywords
This publication has 4 references indexed in Scilit:
- On a graph of Hoffman and SingletonJournal of Combinatorial Theory, Series B, 1971
- There is No Irregular Moore GraphThe American Mathematical Monthly, 1968
- On Minimal graphs of maximum even girthJournal of Combinatorial Theory, 1966
- On Moore Graphs with Diameters 2 and 3IBM Journal of Research and Development, 1960