A switching for all strongly regular collinearity graphs from polar spaces

DOI10.1007/s10801-017-0741-yzbMath1371.05321arXiv1606.05898OpenAlexW2963803932MaRDI QIDQ2408104

Ferdinand Ihringer

Publication date: 9 October 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.05898

zbMATH Keywords

strongly regular graphswitchingpolar space

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Strongly regular graphs from classical generalized quadrangles ⋮ Switched graphs of some strongly regular graphs related to the symplectic graph ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph ⋮ New strongly regular graphs from finite geometries via switching ⋮ Graph switching, 2-ranks, and graphical Hadamard matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Switched symplectic graphs and their 2-ranks
• Strongly regular graphs defined by spreads
• Constructing cospectral graphs
• Characterizing distance-regularity of graphs by the spectrum
• The number of designs with geometric parameters grows exponentially
• Buildings of spherical type and finite BN-pairs
• Switched graphs of some strongly regular graphs related to the symplectic graph
• Godsil-McKay switching and twisted Grassmann graphs
• Strongly regular graphs with the same parameters as the symplectic graph
• A new family of distance-regular graphs with unbounded diameter
• New families of strongly regular graphs