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

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

Updates

• 1986 Lower bound: $70$
  Alegre, I., Fiol, M. A., & Yebra, J. L. A. (1986). Some large graphs with given degree and diameter. Journal of graph theory, 10(2), 219-224.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]