No threshold graphs are cospectral
From MaRDI portal
Abstract: A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the characteristic polynomial of a threshold graph from its binary sequence. Applications include obtaining a formula for the determinant of adjacency matrix of a threshold graph and showing that no two nonisomorphic threshold graphs are cospectral.
Recommendations
Cites work
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- Computing the characteristic polynomial of threshold graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- Constructing cospectral graphs
- Efficient computation of the characteristic polynomial of a threshold graph
- Eigenvalue location for chain graphs
- Eigenvalue location in threshold graphs
- Eigenvalues and energy in threshold graphs
- Exponentially many graphs have a \(Q\)-cospectral mate
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- On nested split graphs whose second largest eigenvalue is less than 1
- On the adjacency matrix of a threshold graph
- On the spectrum of threshold graphs
- Threshold graphs and related topics
Cited in
(24)- On the distance spectra of threshold graphs
- Laplacian spectra and spanning trees of threshold graphs
- On the eigenvalues distribution in threshold graphs
- On bipartite graphs having minimum fourth adjacency coefficient
- The role of the anti-regular graph in the spectral analysis of threshold graphs
- Characterizing threshold graphs with k main signless Laplacian eigenvalues
- Integral cographs
- A conjecture on the eigenvalues of threshold graphs
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- Efficient computation of the characteristic polynomial of a threshold graph
- Eigenvalue-free intervals of distance matrices of threshold and chain graphs
- Efficient computation of the characteristic polynomial of a threshold graph
- Tridiagonal matrices and spectral properties of some graph classes.
- Some Properties of Chain and Threshold Graphs
- Almost controllable graphs and beyond
- An explicit formula for the distance characteristic polynomial of threshold graphs
- Laplacian eigenvalues of equivalent cographs
- Threshold Graphs with an Arbitrary Large Gap Set
- A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
- Laplacian eigenvalues of weighted threshold graphs
- On the Seidel spectrum of threshold graphs
- Eigenvalue-free interval for Seidel matrices of cographs
- On the distance cospectrality of threshold graphs
- Graphs with the minimal Laplacian coefficients
This page was built for publication: No threshold graphs are cospectral
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625488)
