$\text{Diameter-8 distance-regular graphs}$

No. of verticesIntersection ArrayGraph
$90$$\{3,2,2,2,2,1,1,1;1,1,1,1,2,2,2,3\}$$\text{Foster graph}$
$256$$\{8,7,6,5,4,3,2,1; 1,2,3,4,5,6,7,8\}$$\text{8-cube }Q_8 \cong H(8,2)$
$990$$\{7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7\}$$\text{Ivanov-Ivanov-Faradjev graph}$

Back to: Graphs by diameter
Last updated: 21 February 2017