No threshold graphs are cospectral
From MaRDI portal
Publication:1625488
DOI10.1016/j.laa.2018.09.033zbMath1401.05152arXiv1806.07358OpenAlexW2963345395MaRDI QIDQ1625488
Oscar F. Márquez, João Lazzarin, Fernando Colman Tura
Publication date: 29 November 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07358
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
The role of the anti-regular graph in the spectral analysis of threshold graphs ⋮ Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues ⋮ Some Properties of Chain and Threshold Graphs ⋮ Almost controllable graphs and beyond ⋮ Integral cographs ⋮ An explicit formula for the distance characteristic polynomial of threshold graphs ⋮ Laplacian eigenvalues of equivalent cographs ⋮ Tridiagonal matrices and spectral properties of some graph classes ⋮ A conjecture on the eigenvalues of threshold graphs ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the eigenvalues distribution in threshold graphs ⋮ Eigenvalue-free intervals of distance matrices of threshold and chain graphs ⋮ On bipartite graphs having minimum fourth adjacency coefficient
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalue location for chain graphs
- On the spectrum of threshold graphs
- Eigenvalues and energy in threshold graphs
- Efficient computation of the characteristic polynomial of a threshold graph
- Constructing cospectral graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- On nested split graphs whose second largest eigenvalue is less than 1
- Threshold graphs and related topics
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- Exponentially many graphs have a \(Q\)-cospectral mate
- Eigenvalue location in threshold graphs
- On the adjacency matrix of a threshold graph
- Computing the Characteristic Polynomial of Threshold Graphs
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
This page was built for publication: No threshold graphs are cospectral