Degree-diameter problem $N(16,2)$
The largest possible number of vertices in a graph of maximum degree $16$ and diameter $2$.
Lower bound:
$200$
Upper bound:
Unknown
Updates
-
2001-05-25
Lower bound: $198$
Exoo, G. (2001). A family of graphs and the degree/diameter problem. Journal of Graph Theory, 37(2), 118-124. -
2016-10
Lower bound: $200$
Abas, M. (2016). Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree. European Journal of Combinatorics, 57, 109-120.
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]