English

Pseudo-Geometric Strongly Regular Graphs with a Regular Point

Combinatorics 2026-04-10 v3

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 (q,q)(q,q) and a new non-geometric graph with the same parameters as the collinearity graph of the Hermitian generalized quadrangle of order (q2,q)(q^2, q), for prime powers qq. 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, 30, 4, 6).

Keywords

Cite

@article{arxiv.2204.04755,
  title  = {Pseudo-Geometric Strongly Regular Graphs with a Regular Point},
  author = {Edwin van Dam and Krystal Guo},
  journal= {arXiv preprint arXiv:2204.04755},
  year   = {2026}
}

Comments

22 pages, 4 figures

R2 v1 2026-06-24T10:43:47.545Z