Strongly regular graphs from hyperbolic quadrics and their maximal cliques
Combinatorics
2026-02-10 v5
Abstract
Let be a hyperbolic quadric of . Fix a generator of the quadric. Define as the graph with vertex set the points of and two vertices adjacent if they either span a secant to or a line contained in meeting 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 . In this paper, we directly compute the parameters of , which is cospectral, when , to the tangent graph , but it is non-isomorphic for . We also classify the maximal cliques of for , proving as a by-product the non-isomorphism with the graph .
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}
}