Strongly regular graphs satisfying the 4-vertex condition
Abstract
We survey the area of strongly regular graphs satisfying the 4-vertex condition and find several new families. We describe a switching operation on collinearity graphs of polar spaces that produces cospectral graphs. The obtained graphs satisfy the 4-vertex condition if the original graph belongs to a symplectic polar space.
0
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.