Godsil-McKay switching and twisted Grassmann graphs
Preprint
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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Switched symplectic graphs and their 2-ranksDesigns, Codes and Cryptography, 2015
- Godsil-McKay switching and isomorphismThe Electronic Journal of Linear Algebra, 2015
- The twisted Grassmann graph is the block graph of a designInnovations in Incidence Geometry: Algebraic, Topological and Combinatorial, 2011
- The spectra of the local graphs of the twisted Grassmann graphsEuropean Journal of Combinatorics, 2009
- Polarities, quasi-symmetric designs, and Hamada’s conjectureDesigns, Codes and Cryptography, 2008
- Some properties of the twisted Grassmann graphsInnovations in Incidence Geometry: Algebraic, Topological and Combinatorial, 2006
- A new family of distance-regular graphs with unbounded diameterInventiones Mathematicae, 2005
- Constructing cospectral graphsAequationes mathematicae, 1982