The story
Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs.
Etymology from Wiktionary, CC BY-SA 4.0.
Moore graph
Today it means: A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ. Full definition →