This graph is named after Richard A. Games.

Number of vertices: | $729$ |

Diameter: | $2$ |

Intersection array: | $\{112,110;1,20\}$ |

Spectrum: | $112^1 4^{616} (-23)^{112}$ |

Automorphism group: | $3^{6}:2.PSL(3,4).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}$

- A.E. Brouwer and J.H. van Lint, Strongly Regular Graphs and Partial Geometries, in Enumeration and design (eds D.M. Jackson, S.A. Vanstone), Academic Press, Toronto, 1984.
- A.V. Bondarenko and D.V. Radchenko, On a family of strongly regular graphs with λ=1, J. Combin. Theory (B) 103 (2013), 521-531.