Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-20T03:56:09.561Z Has data issue: false hasContentIssue false
  • English
  • Français

On Moore graphs

Published online by Cambridge University Press:  24 October 2008

R. M. Damerell
R. M. Damerell
Affiliation:
Royal Holloway College, University of London
Get access Rights & Permissions [Opens in a new window]

Extract

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:

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 74 , Issue 2 , September 1973 , pp. 227 - 236
Copyright
Copyright © Cambridge Philosophical Society 1973

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Bannai, E. and Ito, T.On finite Moore graphs, to be published in J. Fac. Sci. Univ. Tokyo Sect. I.Google Scholar
(2)Benson, C. T. and Losey, N. E.On a graph of Hoffman and Singleton. J. Combinatorial Theory B 11 (1971), 67–79.CrossRefGoogle Scholar
(3)Biggs, N. L. Finite groups of automorphisms. London Math. Soc. Lecture notes, no. 6 (1971).Google Scholar
(4)Hoffman, A. J. and Singleton, R. R.On Moore graphs with diameters 2 and 3. IBM J. Res. Develop. 4 (1960), 497–504.CrossRefGoogle Scholar
(5)Singleton, R. R.Minimal regular graphs of even girth. J. Combinatorial Theory 1 (1966), 306–322.CrossRefGoogle Scholar
(6)Singleton, R. R.There is no irregular Moore graph. Amer. Math. Monthly 75 (1968), 42–43.CrossRefGoogle Scholar