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

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

Updates

• 2001-05-25 Lower bound: $72$
  Exoo, G. (2001). A family of graphs and the degree/diameter problem. Journal of Graph Theory, 37(2), 118-124.