On the \(\mathrm{PSU}(4,2)\)-invariant vertex-transitive strongly regular \((216, 40, 4, 8)\) graph (Q2175785)

A strongly regular graph with parameters \((v,k,\lambda,\mu)\) is a graph with \(v\) vertices, where each vertex lies on \(k\) edges, any two adjacent vertices have exactly \(\lambda\) common neighbors, and any two non-adjacent vertices have exactly \(\mu\) common neighbors. \textit{D. Crnković} et al. [Discrete Math. 341, No. 10, 2723--2728 (2018; Zbl 1393.05311)] gave the first example of a strongly regular graph with parameters \((216,40,4,8)\) and showed that it is the unique \(\mathrm{PSU}(4,2)\)-invariant vertex-transitive graph on \(216\) vertices. This example was constructed with the aid of a computer. In this paper, the authors use the geometry of the Hermitian surface of \(\mathrm{PG}(3,4)\) to give a proof of the existence of such a graph without the aid of a computer. They also determine all maximal cliques in the graph.