Abstract:
We consider non-directed graphs without loops and multiple edges.
A strongly regular graph with parameters $(v,k,\lambda,\mu)$ is the graph
with $v$ vertices such that for any vertex $a$ its neighbourhood $[a]$
consists of $k$ vertices and any edge is adjacent to exactly $\lambda$
common vertices and any non-edge is adjacent to exactly $\mu$ vertices.
We prove that the strongly regular graph with parameters $(64,18,2,6)$
is geometric.