On strongly regular graphs with parameters \((k,0,2)\) and their antipodal double covers (Q5945559): Difference between revisions

Distance-regular graphs with \(b_2=1\) are considered. Let the valency \(k\) be greater than 2. If the diameter \(d(\Gamma)\) is larger than 4, then \(\Gamma\) is isomorphic to the dodecahedron. If \(d(\Gamma)=4\), then \(\Gamma\) is an antipodal double cover of a strongly regular graph with parameters \((n^2+1,0,2)\) for an integer \(n\) not divisible by 4 and if \(d(\Gamma)=3\), then \(\Gamma\) is an antipodal cover of a complete graph. At present the strongly regular graphs with parameters \((5,0,2)\) and \((10,0,2)\) are known. Theorem 2.1. Let \(\Gamma\) be a strongly regular graph with parameters \((q^2+1,0,2)\) and \(G\) be a subgroup of \(\text{Aut} (\Gamma)\) isomorphic to \(\text{PGL}(2,q^2)\) for an odd \(q\). If \(G\) stabilizes a vertex \(a\) of \(\Gamma\) and \(G\) is transitive on \(\Gamma_2(a)\), then \(q=3\). Let \(\Gamma^*\) be the antipodal double cover of a strongly regular graph \(\Gamma\) with parameters \((k,0,2)\), \(k>5\). Then for any vertex \(a\) of \(\Gamma^*\) and for \(X=\Gamma^*_2(a)\) there exists a symmetric 6-association scheme on \(X\) with prescribed parameters (Theorem 3.2). Let \({\mathcal R}= (X,R_{i(0\leq i\leq 6)})\) be a symmetric 6-association scheme with the same parameters \(p^j_{h,i}\) as in Theorem 3.2. Then the antipodal double cover of a strongly regular graph with parameters \((k,0,2)\) can be reconstructed from \(\mathcal R\). Moreover the graph \((X,R_1)\) is isomorphic to the second neighbourhood of \(\Gamma^*\) with respect to any vertex (Theorem 3.3).