Strongly regular graphs that are locally a disjoint union of hexagons (Q1363002)

Let a strongly regular graph (srg) \(G\) be locally a disjoint union of hexagons. It is proved that such a graph \(G\) does not have the parameters \((40, 12, 2, 4)\) and there are precisely two such graphs with the parameters \((64, 18, 2, 6)\). Let \(\Gamma\) be a point graph of \(\text{GQ}(3,5)\). The first \(\text{srg}(64, 18, 2, 6)\) \({\mathcal G}_1\) is obtained from \(\Gamma\) by switching. \(\text{GQ}(3,5)\) can be described as follows. Consider \(\text{AG}(3,4)\) and let \(S\) be a set of 6 lines from \(\text{AG}(3,4)\) passing through one point, such that no three lines lie in one hyperplane. Each hyperplane of \(\text{AG}(3,4)\) contains two or no lines from \(S\) (and it is called two-plane or zero-plane). The points of \(\text{GQ}(3,5)\) are the points of \(\text{AG}(3,4)\), and the lines of \(\text{GQ}(3,5)\) are the lines of \(S\) and the lines of \(\text{AG}(3,4)\) parallel to a line of \(S\). Let \(l\) be a line in \(\text{AG}(3,4)\) that is not a line of GQ. Then two of the five hyperplanes through \(l\) are zero-plane. Let \(L_1\) be a set of four lines paralel to \(l\). Then the graph \({\mathcal G}_1\) is obtained from \(\Gamma\) by switching with respect to \(L_1\). It turns out that each of the eleven 4-colorable graphs with parameters of \(\Gamma\) can be obtained from \(\Gamma\) by switching with respect to a suitable subset of lines parallel to \(l\). In the reviewer's paper [``On strongly regular graph with parameters \((64, 18, 2, 6)\),'' Diskretn. Mat. 7, No. 3, 121-128 (1995) (Russian); English translation in Discrete Math. Appl. 5, No. 5, 463-472 (1995; Zbl 0847.05100)] there is some mistake. The next theorem is the correction of the result. Let \(\Gamma\) be a strongly regular graph with parameters \((64, 18, 2, 6)\). \(\{a,b,c\}\) be a triangle of \(\Gamma\). Let \(x\), \(y\), \(z\) be new vertices adjacent with the pairs of vertices \(\{a,b\}\), \(\{b,c\}\), \(\{a,c\}\). Then the subgraph of \(\Gamma\) induced by \(\{a,b,c;x,y,z\}\) is called a big triangle. Theorem: Let \(\Gamma\) be a strongly regular graph with parameters \((64, 18, 2, 6)\), and for every big triangle \(\Delta= \{a,b,c;x,y,z\}\) there be a unique vertex \(w\) not adjacent to any vertex of \(\Delta\). Then \(\Gamma\) is a point graph of \(\text{GQ}(3,5)\).