On Moore graphs-Reference-Cited by-同舟云学术

On Moore graphs

Published:1973-09 Issue:2 Volume:74 Page:227-236
ISSN:0305-0041
Container-title:Mathematical Proceedings of the Cambridge Philosophical Society
language:en
Short-container-title:Math. Proc. Camb. Phil. Soc.

Author:

Damerell R. M.

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:

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference6 articles.

1. On a graph of Hoffman and Singleton

2. There is No Irregular Moore Graph

3. On Minimal graphs of maximum even girth

4. On Moore Graphs with Diameters 2 and 3

5. (3) Biggs N. L. Finite groups of automorphisms. London Math. Soc. Lecture notes, no. 6 (1971).

Cited by 92 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PolarStar: Expanding the Horizon of Diameter-3 Networks;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. The structure of digraphs with excess one;Journal of Graph Theory;2024-02-19

3. On decreasing the orders of $$(k,g)$$-graphs;Journal of Combinatorial Optimization;2023-11

4. Pattern polynomial graphs;Indian Journal of Pure and Applied Mathematics;2023-06-17

5. On abelian cayley graphs of diameter two and defect one;Journal of Algebraic Combinatorics;2023-06-08