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

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

Updates

• 1964-11 Lower bound: $20$
  Elspas, B. (1964, November). Topological constraints on interconnection-limited logic. In 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design (pp. 133-137). IEEE.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]
• 1964-11 Upper bound: $20$
  Elspas, B. (1964, November). Topological constraints on interconnection-limited logic. In 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design (pp. 133-137). IEEE.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]