Cospectral graphs and regular orthogonal matrices of level 2

MaRDI QIDQ456333zbMATH OpenFDO

Authors Aida Abiad, Willem H. Haemers

Publication date 24 October 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.2945, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p13

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

cospectral graphsorthogonal matricesswitching

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Orthogonal matrices (15B10)

Abstract: We apply Godsil-McKay switching to the symplectic graphs over $mathbb{F}_2$ with at least 63 vertices and prove that the 2-rank of (the adjacency matrix of) the graph increases after switching. This shows that the switched graph is a new strongly regular graph with parameters $(2^{2u}!-1,2^{2u-1},2^{2u-2},2^{2u-2})$ and 2-rank $2u+2$ when $ugeq3$. For the symplectic graph on $63$ vertices we investigate repeated switching by computer and find many new strongly regular graphs with the above parameters for $u=3$ with various 2-ranks. Using these results and a recursive construction method for the symplectic graph from Hadamard matrices, we obtain several graphs with the above parameters, but different 2-ranks for every $ugeq3$.

Review text

Summary: For a graph \(\Gamma\) with adjacency matrix \(A\), we consider a switching operation that takes \(\Gamma\) into a graph \(\Gamma'\) with adjacency matrix \(A'\), defined by \(A'=Q^\top A Q\), where \(Q\) is a regular orthogonal matrix of level 2 (that is, \(Q^\top Q=I\), \(Q1 = 1\), \(2Q\) is integral, and \(Q\) is not a permutation matrix). If such an operation exists, and \(\Gamma\) is nonisomorphic with \(\Gamma'\), then we say that \(\Gamma'\) is semi-isomorphic with \(\Gamma\). Semi-isomorphic graphs are \(\mathbb {R}\)-cospectral, which means that they are cospectral and so are their complements. \textit{W. Wang} and \textit{C.-H. Xu} [Linear Algebra Appl. 418, No. 1, 62--74 (2006; Zbl 1105.05050)] expect that almost all pairs of nonisomorphic \(\mathbb {R}\)-cospectral graphs are semi-isomorphic. Regular orthogonal matrices of level 2 have been classified. By use of this classification we work out the requirements for this switching operation to work in case \(Q\) has one nontrivial indecomposable block of size \(4, 6, 7\) or 8. Size 4 corresponds to Godsil-McKay switching. The other cases provide new methods for constructions of \(\mathbb {R}\)-cospectral graphs. For graphs with eight vertices all these constructions are carried out. As a result we find that, out of the 1166 graphs on eight vertices which are \(\mathbb {R}\)-cospectral to another graph, only 44 are not semi-isomorphic to another graph.

Recommendations

• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• Constructing cospectral graphs via regular rational orthogonal matrices with level two
• Enumeration of cospectral graphs.
• Godsil-McKay switching and isomorphism
• Large families of cospectral graphs

Cited in

(21)

• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
• The smallest pair of cospectral cubic graphs with different chromatic indexes
• Constructing cospectral graphs via regular rational orthogonal matrices with level two
• On a theorem of Godsil and McKay concerning the construction of cospectral graphs
• Cospectral constructions for several graph matrices using cousin vertices
• Generalized cospectral graphs with and without Hamiltonian cycles
• Main Q-eigenvalues and generalized Q-cospectrality of graphs
• Constructing families of cospectral regular graphs
• A note on non-\(\mathbb{R}\)-cospectral graphs
• Godsil-McKay switching and isomorphism
• Large families of cospectral graphs
• Cospectral mates for generalized Johnson and Grassmann graphs
• Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
• Cokernel statistics for walk matrices of directed and weighted random graphs
• Counting cospectral graphs obtained via switching
• Haemers’ Conjecture: An Algorithmic Perspective
• Constructing cospectral graphs via regular rational orthogonal matrix with level two and three
• Constructing cospectral hypergraphs
• Constructing adjacency and distance cospectral graphs via regular rational orthogonal matrix
• Switching graphs and Hadamard matrices

This page was built for publication: Cospectral graphs and regular orthogonal matrices of level 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456333)