Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 1-2/2017

02-07-2016

Godsil–McKay switching and twisted Grassmann graphs

Author: Akihiro Munemasa

Published in: Designs, Codes and Cryptography | Issue 1-2/2017

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.
previous article On resolvable Steiner 2-designs and maximal arcs in projective planes
next article Integral automorphisms of affine spaces over finite fields
Literature
1.
Abiad A., Brouwer A.E., Haemers W.H.: Godsil–McKay switching and isomorphism. Electron. J. Linear Algebr. 28, 3–11 (2015).
2.
Abiad A., Haemers W.H.: Switched symplectic graphs and their 2-ranks, to appear in Des. Codes Cryptogr.
3.
Bang S., Fujisaki T., Koolen J.H.: The spectra of the local graphs of the twisted Grassmann graphs. Eur. J. Combin. 30, 638–654 (2009).
4.
Bannai E., Ito T.: Algebraic Combinatorics I. Benjamin/Cummings, Menlo Park (1984).
5.
Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Heidelberg (1989).
6.
Fujisaki T., Koolen J.H., Tagami M.: Some properties of the twisted Grassmann graphs. Innov. Incid. Geom. 3, 81–87 (2006).
7.
Godsil C.D., McKay B.D.: Constructing cospectral graphs. Aequ. Math. 25, 257–268 (1982).
8.
Jungnickel D., Tonchev V.D.: Polarities, quasi-symmetric designs, and Hamada’s conjecture. Des. Codes Cryptogr. 51, 131–140 (2009).
9.
Metsch K.: A characterization of Grassmann graphs. Europ. J. Combin. 16, 639–644 (1995).
10.
Munemasa A., Tonchev V.D.: The twisted Grassmann graph is the block graph of a design. Innov. Incid. Geom. 12, 1–6 (2011).
11.
van Dam E.R., Koolen J.H.: A new family of distance-regular graphs with unbounded diameter. Invent. Math. 162, 189–193 (2005).
12.
van Dam E.R., Haemers W.H., Koolen J.H., Spence E.: Characterizing distance-regularity of graphs by the spectrum. J. Combin. Theory, Ser. A 113, 1805–1820 (2006).
13.
van Dam E.R., Koolen J.H., Tanaka H.: Distance-regular graphs. Electron. J. Combin. #DS22 (2016).
Metadata
Title
Godsil–McKay switching and twisted Grassmann graphs
Author
Akihiro Munemasa
Publication date
02-07-2016
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1-2/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0244-1

Other articles of this Issue 1-2/2017

Designs, Codes and Cryptography 1-2/2017 Go to the issue

OriginalPaper

On resolvable Steiner 2-designs and maximal arcs in projective planes

OriginalPaper

Relative t-designs in binary Hamming association scheme H(n, 2)

OriginalPaper

The spurs of D. H. Lehmer

OriginalPaper

On almost small and almost large super-Vandermonde sets in GF(q)

OriginalPaper

On eigenvalues of Seidel matrices and Haemers’ conjecture

OriginalPaper

The graphs with all but two eigenvalues equal to or 0

Premium Partner

    Image Credits