A new construction of strongly regular graphs with parameters of the complement symplectic graph (Q2684897)

The author describes a general procedure to obtain many divisible design graphs and strongly regular graphs (SRGs) coming from affine designs. In particular, a new construction for an SRG with the same parameters as the symplectic graph is obtained. Prolific constructions of such graphs have been obtained recently by switching in [\textit{F. Ihringer}, J. Algebr. Comb. 46, No. 2, 263--274 (2017; Zbl 1371.05321)]. Divisible design graphs were introduced in [\textit{W. H. Haemers} et al., J. Comb. Theory, Ser. A 118, No. 3, 978--992 (2011; Zbl 1232.05131)] in order to investigate connections between combinatorial designs and (algebraic) graph theory. Based on ideas from well-known prolific constructions of SRGs by \textit{W. D. Wallis} [Bull. Aust. Math. Soc. 4, 41--49 (1971; Zbl 0203.30802)], \textit{D. G. Fon-Der-Flaass} [Adv. Geom. 2, No. 3, 301--306 (2002; Zbl 1012.05158)], and \textit{M. Muzychuk} [J. Algebr. Comb. 25, No. 2, 169--187 (2007; Zbl 1111.05101)] (all independently), the author describes a construction for divisible design graphs based on affine designs. Two constructions for SRGs are then described, one using the former class of graphs as a building block, the other based on Hoffman colorings. For certain small parameter tuples such as (35,18,9,9), exhaustive computer searches have found all 3854 SRGs [\textit{B. D. McKay} and \textit{E. Spence}, Australas. J. Comb. 24, 293--300 (2001; Zbl 0979.05110)]. With this general construction, the author manages to recover a sizable proportion of them, in this case, 499 of them. However, it remains unclear how many non-isomorphic constructions the result provides in general.