On the Seidel spectrum of threshold graphs
Santanu Mandal, Ranjit Mehatari

TL;DR
This paper investigates the spectral properties of the Seidel matrix in connected threshold graphs, providing formulas for eigenvalues, characteristic polynomial, and constructing Seidel cospectral graphs.
Contribution
It introduces new formulas for eigenvalues and characteristic polynomial of the Seidel matrix in threshold graphs, and constructs families of Seidel cospectral graphs.
Findings
Formulas for eigenvalues ±1 of the Seidel matrix
Characterization of threshold graphs with up to 5 distinct Seidel eigenvalues
Construction of Seidel cospectral threshold graphs
Abstract
In this paper, we analyse spectral properties of Seidel matrix (denoted by ) of connected threshold graphs. We compute the characteristic polynomial and determinant of Seidel matrix of threshold graphs. We derive formulas for the multiplicity of the eigenvalues of . Further we determine threshold graphs with at most 5 distinct Seidel eigenvalues. Finally we construct families of Seidel cospectral threshold graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Molecular spectroscopy and chirality · Matrix Theory and Algorithms
