Pseudo-Geometric Strongly Regular Graphs with a Regular Point
Edwin van Dam, Krystal Guo

TL;DR
This paper characterizes pseudo-geometric strongly regular graphs with a special vertex, constructs many new examples, and significantly expands the known catalog of such graphs with specific parameters.
Contribution
It provides a complete characterization of these graphs, answers an open question, and offers explicit constructions for numerous new strongly regular graphs.
Findings
Characterized all graphs with the special vertex property.
Constructed q new non-isomorphic graphs with collinearity graph parameters.
Computed over 160,000 new strongly regular graphs with specific parameters.
Abstract
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs containing such a vertex, and use our characterization to find many new strongly regular graphs. Thereby, we answer a question posed by Gardiner, Godsil, Hensel, and Royle. We give an explicit construction for q new, pairwise non-isomorphic graphs with the same parameters as the collinearity graph of generalized quadrangles of order and a new non-geometric graph with the same parameters as the collinearity graph of the Hermitian generalized quadrangle of order , for prime powers . Using our characterization, we computed 135478 new strongly regular graphs with parameters (85,20,3,5) and 27 039 strongly regular graphs with parameters (156,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
