Godsil-McKay switching and twisted Grassmann graphs
From MaRDI portal
Publication:2364635
Abstract: We show that the twisted Grassmann graphs introduced by Van Dam and Koolen are obtained by Godsil-McKay switching applied to the Grassmann graphs. The partition for the switching is constructed by a polarity of a hyperplane.
Recommendations
Cites work
- A characterization of Grassmann graphs
- A new family of distance-regular graphs with unbounded diameter
- Characterizing distance-regularity of graphs by the spectrum
- Constructing cospectral graphs
- Distance-regular graphs
- Godsil-McKay switching and isomorphism
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Polarities, quasi-symmetric designs, and Hamada's conjecture
- Some properties of the twisted Grassmann graphs
- Switched symplectic graphs and their 2-ranks
- The spectra of the local graphs of the twisted Grassmann graphs
- The twisted Grassmann graph is the block graph of a design
Cited in
(11)- The spectra of the local graphs of the twisted Grassmann graphs
- Unification of graph products and compatibility with switching
- The Terwilliger algebra of the twisted Grassmann graph: the thin case
- New strongly regular graphs from finite geometries via switching
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- A switching for all strongly regular collinearity graphs from polar spaces
- The twisted Grassmann graph is the block graph of a design
- On small world non-Sunada twins and cellular Voronoi diagrams
- The strongly regular twisted \(D_{5 , 5} ( q )\) graph
- A characterization of the Grassmann graphs
- Some properties of the twisted Grassmann graphs
This page was built for publication: Godsil-McKay switching and twisted Grassmann graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364635)