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

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

Updates

• 2001-05-25 Lower bound: $912$
  Exoo, G. (2001). A family of graphs and the degree/diameter problem. Journal of Graph Theory, 37(2), 118-124.
• 2008-06-03 Lower bound: $916$
  Gómez, J. (2009), Some new large (Δ, 3)-graphs. Networks, 53: 1-5.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]