Moore graph en · NOUN
Etymology
Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs.
Meanings
- A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ.
Forms
| Spelling | Features | Labels | Source |
|---|---|---|---|
| Moore graphs | Number=Plur | lexicographic |