Tridiagonal matrices and spectral properties of some graph classes.
From MaRDI portal
Recommendations
Cites work
- An introduction to the theory of graph spectra
- Eigenvalue location for chain graphs
- Eigenvalue-free interval for threshold graphs
- Eigenvalues and energy in threshold graphs
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- Matrices, Digraphs, and Determinants
- No threshold graphs are cospectral
- On the eigenvalues of some tridiagonal matrices
- Some new considerations about double nested graphs
- Spectral characterizations of anti-regular graphs
- Sufficient conditions for positive definiteness of tridiagonal matrices revisited
- Vertex types in threshold and chain graphs
Cited in
(14)- Gap sets for the spectra of regular graphs with minimum spectral gap
- On bipartite graphs having minimum fourth adjacency coefficient
- Eigenvalue-free interval for Seidel matrices of threshold graphs
- The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions
- Vertex types in threshold and chain graphs
- Eigenvalue location for chain graphs
- scientific article; zbMATH DE number 6093181 (Why is no real title available?)
- Some Properties of Chain and Threshold Graphs
- Chain graph sequences and Laplacian spectra of chain graphs
- Laplacian eigenvalues of equivalent cographs
- On the eigenvalues and Seidel eigenvalues of chain graphs
- Threshold Graphs with an Arbitrary Large Gap Set
- A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
- Fast breakdown-free algorithm for computing the determinants of a generalized comrade matrix
This page was built for publication: Tridiagonal matrices and spectral properties of some graph classes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140404)
