Godsil-McKay switching and twisted Grassmann graphs
From MaRDI portal
Publication:2364635
DOI10.1007/s10623-016-0244-1zbMath1367.05026arXiv1512.09232OpenAlexW3103258021MaRDI QIDQ2364635
Publication date: 21 July 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.09232
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (7)
A switching for all strongly regular collinearity graphs from polar spaces ⋮ Unification of graph products and compatibility with switching ⋮ The strongly regular twisted \(D_{5 , 5} ( q )\) graph ⋮ The Terwilliger algebra of the twisted Grassmann graph: the thin case ⋮ On small world non-Sunada twins and cellular Voronoi diagrams ⋮ New strongly regular graphs from finite geometries via switching ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Switched symplectic graphs and their 2-ranks
- The twisted Grassmann graph is the block graph of a design
- Constructing cospectral graphs
- Some properties of the twisted Grassmann graphs
- Characterizing distance-regularity of graphs by the spectrum
- Polarities, quasi-symmetric designs, and Hamada's conjecture
- The spectra of the local graphs of the twisted Grassmann graphs
- A characterization of Grassmann graphs
- A new family of distance-regular graphs with unbounded diameter
- Godsil-McKay switching and isomorphism
This page was built for publication: Godsil-McKay switching and twisted Grassmann graphs