Number of vertices: | $1024$ |

Diameter: | $3$ |

Intersection array: | $\{33,30,15;1,2,15\}$ |

Spectrum: | $33^1 9^{198} 1^495 (-7)^{330}$ |

Automorphism group: | $2^{10}:(9:3):2$ |

Distance-transitive: | $\text{No}$ |

Primitive |

- $\text{Adjacency matrix}$
- $\text{Adjacency matrix in GAP format}$
- $\text{Adjacency matrix in CSV format}$
- $\text{Graph in GRAPE format}$

- M.Shi, D.S. Krotov and P. Solé, A new distance-regular graph of diameter 3 on 1024 vertices,
*Des. Codes Cryptography***87**(2019), 2091–2101.