Switched graphs of some strongly regular graphs related to the symplectic graph (Q1692159)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6830016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Switched graphs of some strongly regular graphs related to the symplectic graph |
scientific article; zbMATH DE number 6830016 |
Statements
Switched graphs of some strongly regular graphs related to the symplectic graph (English)
0 references
26 January 2018
0 references
The authors use the Godsil-McKay switching to construct new classes of strongly regular graphs cospectral with strongly regular graphs obtained from (elliptic or hyperbolic) non-singular quadrics in projective space \(\mathrm{PG}(n,2)\) for odd \(n\geq 5\), which have parameters \((2^n \pm 2^{\frac{n-1}2}, 2^{n-1}\pm 2^{\frac{n-1}2}, 2^{n-2}\pm 2^{\frac{n-3}2}, 2^{n-2}\pm 2^{\frac{n-1}2})\). The paper further gives the number of the non-isomorphic switched graphs found in this way, and determines the parameters of the binary linear codes associated with these switched graphs.
0 references
strongly regular graph
0 references
cospectral graph
0 references
linear code of a graph
0 references
0.8797446489334106
0 references
0.8727822303771973
0 references
0.8540804982185364
0 references
0.8378496766090393
0 references
0.8340680003166199
0 references