Locating Eigenvalues of Symmetric Matrices - A Survey
From MaRDI portal
Publication:6198240
DOI10.13001/ela.2024.7979OpenAlexW4390966500WikidataQ129995343 ScholiaQ129995343MaRDI QIDQ6198240
Carlos Hoppen, Vilmar Trevisan, David P. Jacobs
Publication date: 21 February 2024
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.13001/ela.2024.7979
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distribution of Laplacian eigenvalues of trees
- On the spectrum of threshold graphs
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Eigenvalues and energy in threshold graphs
- Treewidth computations. II. Lower bounds
- Locating the eigenvalues of trees
- On the number of Laplacian eigenvalues of trees less than the average degree
- Some spectral properties of cographs
- Matrix multiplication via arithmetic progressions
- Treewidth computations. I: Upper bounds
- Asymptotic results on the spectral radius and the diameter of graphs
- Graph minors. I. Excluding a forest
- On the distribution of the maximum eigenvalues of graphs
- Complement reducible graphs
- S-functions for graphs
- A partial k-arboretum of graphs with bounded treewidth
- \(k\)-NLC graphs and polynomial algorithms
- Treewidth. Computations and approximations
- Eigenvalue location in graphs of small clique-width
- Eigenvalue location in cographs
- On a conjecture for the sum of Laplacian eigenvalues
- Upper bounds to the clique width of graphs
- On Quipus whose signless Laplacian index does not exceed 4.5
- Integral cographs
- Most Laplacian eigenvalues of a tree are small
- Locating eigenvalues of unbalanced unicyclic signed graphs
- Every totally real algebraic integer is a tree eigenvalue
- Trees with 4 or 5 distinct normalized Laplacian eigenvalues
- Locating the eigenvalues for graphs of small clique-width
- Spectral ordering of trees with small index
- Laplacian energy of diameter 3 trees
- On the sum of the Laplacian eigenvalues of a tree
- Eigenvalue location in threshold graphs
- Characterizing trees with large Laplacian energy
- Indices for special classes of trees
- Approximating clique-width and branch-width
- Nonserial dynamic programming
- Clique-width minimization is NP-hard
- Computing the Characteristic Polynomial of Threshold Graphs
- A Linear Recognition Algorithm for Cographs
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Relative bilinear complexity and matrix multiplication.
- Spectral properties of cographs andP5-free graphs
- Locating eigenvalues of unicyclic graphs
- Locating Eigenvalues in Graphs
- Spectral radius ordering of starlike trees
- Applications of rational difference equations to spectral graph theory
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
