Degree-diameter problem $N(16,7)$
The largest possible number of vertices in a graph of maximum degree $16$ and diameter $7$.
Lower bound:
$14882658$
(14,882,658)
Upper bound:
Unknown
Updates
-
1993-04-28
Lower bound: $14882658$
(14,882,658)
Gómez, J., Fiol, M. A., & Serra, O. (1993). On large (Δ, D)-graphs. Discrete Mathematics, 114(1-3), 219-235.
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]