Abstract: A conference matrix of order is an matrix with diagonal entries and off-diagonal entries satisfying . If is symmetric, then has a symmetric spectrum (that is, ) and eigenvalues . We show that many principal submatrices of also have symmetric spectrum, which leads to examples of Seidel matrices of graphs (or, equivalently, adjacency matrices of complete signed graphs) with a symmetric spectrum. In addition, we show that some Seidel matrices with symmetric spectrum can be characterized by this construction.
Recommendations
Cites work
- scientific article; zbMATH DE number 3668628 (Why is no real title available?)
- scientific article; zbMATH DE number 3756498 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- Equiangular lines in Euclidean spaces
- Graphs which contain all small graphs
- On sign-symmetric signed graphs
- On the spectrum of some signed complete and complete bipartite graphs
- Open problems in the spectral theory of signed graphs
- Spectra of graphs
- Symmetric Conference Matrices of Order pq 2 + 1
- Symmetric and Skew-Symmetric {0,±1}-Matrices with Large Determinants
Cited in
(3)
This page was built for publication: Spectral symmetry in conference matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168068)