Degree-diameter problem $N(3,2)$

The largest possible number of vertices in a graph of maximum degree $3$ and diameter $2$.

Updates

• Lower bound: $10$
  Reference unknown
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]
• Upper bound: $10$
  Reference unknown
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]