Degree-diameter problem $N(11,10)$

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

Updates

• 2008 Lower bound: $600380000$ (600,380,000)
  Loz, E., & Sirán, J. (2008). New record graphs in the degree-diameter problem. Australasian Journal of Combinatorics, 41, 63.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]