Degree-diameter problem $N(8,6)$
The largest possible number of vertices in a graph of maximum degree $8$ and diameter $6$.
Lower bound:
$39672$
(39,672)
Upper bound:
Unknown
Updates
-
2008-06-03
Lower bound: $39672$
(39,672)
Gómez, J. (2009), Some new large (Δ, 3)-graphs. Networks, 53: 1-5.
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]