The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\) (Q5946641): Difference between revisions

The collinearity graph of a generalized quadrangle of order \((s,t)\) is strongly regular with parameters \(v=(s+1)(st+1)\), \(k=s(t+1)\), \(\Lambda=s-1\), \(\mu=t+1\). A strongly regular graph with this parameters (for some \(s\) and \(t\)) is called pseudo-geometric for a \(\text{GQ}(s,t)\). If \(s=3\) then \(t=1,3,5,6,9\) (for \(s+t\) divides \(st(s+1)(t+1)\)). There are precisely five \(\text{GQ}(3,t)\), namely one for \(t=1,5,9\) and two for \(t=3\). Consider pseudo-geometric graphs for a \(\text{GQ}(3,t)\). There are precisely two such graphs for \(t=1\) (Shrikhande), 28 graphs for \(t=3\) (Spence), no graphs for \(t=6\) (Haemers and idependently the referee) and one graph for \(t=9\). The main result of this paper (based on computer search) is Theorem 2: There exist precisely 167 strongly regular graphs with parameters \((64,18,2,6)\), one being the collinearity graph of the generalized quadrangle of order \((3,5)\).