Noun
Moore graph (plural Moore graphs)
(graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound
1
+
d
∑
i
=
0
k
−
1
(
d
−
1
)
i
{\displaystyle 1+d\sum _{i=0}^{k-1}(d-1)^{i}}
.