Degree-diameter problem N(18,8)N(18,8)

The largest possible number of vertices in a graph of maximum degree 1818 and diameter 88.

Lower bound: 323037476323037476 (323,037,476)
Upper bound: Unknown

Updates