English

Strongly regular graphs from hyperbolic quadrics and their maximal cliques

Combinatorics 2026-02-10 v5

Abstract

Let Q+(2n+1,q)Q^+(2n+1,q) be a hyperbolic quadric of \PG(2n+1,q)\PG(2n+1,q). Fix a generator Π\Pi of the quadric. Define \cGn\cG_n as the graph with vertex set the points of Q+(2n+1,q)ΠQ^+(2n+1,q)\setminus \Pi and two vertices adjacent if they either span a secant to Q+(2n+1,q)Q^+(2n+1,q) or a line contained in Q+(2n+1,q)Q^+(2n+1,q) meeting Π\Pi non-trivially. Then such a construction defines a strongly regular graph, which is the complement of a (non-induced) subgraph of the collinearity graph of Q+(2n+1,q)Q^+(2n+1,q). In this paper, we directly compute the parameters of \cGn\cG_n, which is cospectral, when q=2q=2, to the tangent graph NO+(2n+2,2)NO^+(2n+2,2), but it is non-isomorphic for n3n\geq3. We also classify the maximal cliques of \cG3\cG_3 for q=2q=2, proving as a by-product the non-isomorphism with the graph NO+(8,2)NO^+(8,2).

Keywords

Cite

@article{arxiv.2504.19560,
  title  = {Strongly regular graphs from hyperbolic quadrics and their maximal cliques},
  author = {Antonio Cossidente and Jan De Beule and Giuseppe Marino and Francesco Pavese and Valentino Smaldore},
  journal= {arXiv preprint arXiv:2504.19560},
  year   = {2026}
}
R2 v1 2026-06-28T23:13:24.882Z