Degree-diameter problem N(15,5)N(15,5)

The largest possible number of vertices in a graph of maximum degree 1515 and diameter 55.

Lower bound: 7752077520 (77,520)
Upper bound: Unknown

Updates