Strongly regular graphs from hyperbolic quadrics and their maximal cliques
Abstract
Let Q+(2n+1,q) be a hyperbolic quadric of (2n+1,q). Fix a generator Π of the quadric. Define n as the graph with as vertex set the points of Q+(2n+1,q) Π and two vertices adjacent if they either span a secant to Q+(2n+1,q) or a line contained in Q+(2n+1,q) 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 Q+(2n+1,q). In this paper, we directly compute the parameters of n, which is cospectral, when q=2, to the tangent graph NO+(2n+2,2), but it is non-isomorphic for n≥3. We also classify the maximal cliques of 3 for q=2, proving as a by-product the non-isomorphism with the graph NO+(8,2).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.