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

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

Updates

• 2010-09 Lower bound: $1610$
  Loz, E., & Pineda-Villavicencio, G. (2010). New benchmarks for large-scale networks with given maximum degree and diameter. The Computer Journal, 53(7), 1092-1105.
  [via The Degree Diameter Problem for General Graphs - Combinatorics Wiki]