Strongly regular graphs satisfying the 4-vertex condition
A. E. Brouwer, F. Ihringer, W. M. Kantor
TL;DR
This paper surveys strongly regular graphs satisfying the 4-vertex condition, introduces a switching operation on collinearity graphs of polar spaces, and identifies new graph families with specific spectral properties.
Contribution
It presents new families of strongly regular graphs satisfying the 4-vertex condition and describes a switching method to generate cospectral graphs in polar spaces.
Findings
New families of strongly regular graphs satisfying the 4-vertex condition
A switching operation producing cospectral graphs in polar spaces
Graphs from symplectic polar spaces satisfy 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Graph theory and applications