Spectral symmetry in conference matrices

From MaRDI portal
Publication:2168068

DOI10.1007/S10623-021-00858-8zbMATH Open1496.05014arXiv2004.05829OpenAlexW3138849309MaRDI QIDQ2168068FDOQ2168068


Authors: Willem H. Haemers, Leila Parsaei Majd Edit this on Wikidata


Publication date: 31 August 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: A conference matrix of order n is an nimesn matrix C with diagonal entries 0 and off-diagonal entries pm1 satisfying CCop=(n1)I. If C is symmetric, then C has a symmetric spectrum Sigma (that is, Sigma=Sigma) and eigenvalues pmsqrtn1. We show that many principal submatrices of C 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.


Full work available at URL: https://arxiv.org/abs/2004.05829




Recommendations




Cites Work


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)