Moore graph

Etymology
Named in 1960 by Hoffman and Singleton, after, who posed the question of describing and classifying these graphs.

Noun

 * 1)  A regular graph of degree d and diameter k whose number of vertices equals the upper bound $$1+d\sum_{i=0}^{k-1}(d-1)^i$$.