Degree-diameter problem $N(8,2)$
The largest possible number of vertices in a graph of maximum degree $8$ and diameter $2$.
Lower bound:
$57$
Upper bound:
Unknown
The largest possible number of vertices in a graph of maximum degree $8$ and diameter $2$.
Lower bound:
$57$
Upper bound:
Unknown