A Switching for all Strongly Regular Collinearity Graphs From Polar\n Spaces

2016/06/19 by Ferdinand Ihringer, Ihringer, Ferdinand · 1 citation
Computer Science · Mathematics · #05B25 #05C62 #05E30 #51E20 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.1606.05898

openalex publication_date 2016/06/19 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28

Abstract

We describe a general construction of strongly regular graphs from the\ncollinearity graph of a finite classical polar spaces of rank at least 3 over\na finite field of order q. We show that these graphs are non-isomorphic to\nthe collinearity graphs and have the same parameters. To our knowledge for most\nof these parameters these graphs are new as the collinearity graphs were the\nonly known examples.\n

Cited by

• Design switching on graphs

Related

• New Strongly Regular Graphs from Finite Geometries via Switching
• Strongly regular graphs satisfying the 4-vertex condition
• Switching equivalence of strongly regular polar graphs
• Computations regarding certain graphs associated to finite polar spaces
• On intriguing sets in five classes of strongly regular graphs