Locating Eigenvalues of Symmetric Matrices - A Survey

DOI10.13001/ELA.2024.7979MaRDI QIDQ6198240zbMATH OpenOpenAlexWikidataFDO

Authors Carlos Hoppen, David P. Jacobs, Vilmar Trevisan

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

zbMATH Keywords

clique-widtheigenvaluelocating eigenvaluesspectral graph theorysymmetric matrixtreewidth

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Locating eigenvalues in graphs. Algorithms and applications
• Eigenvalue location in cographs
• Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
• Eigenvalue location in threshold graphs
• Eigenvalue location in graphs of small clique-width

Cites work

• \(k\)-NLC graphs and polynomial algorithms
• A Linear Recognition Algorithm for Cographs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A partial k-arboretum of graphs with bounded treewidth
• Applications of rational difference equations to spectral graph theory
• Approximating clique-width and branch-width
• Asymptotic results on the spectral radius and the diameter of graphs
• Characterizing trees with large Laplacian energy
• Clique-width minimization is NP-hard
• Complement reducible graphs
• Complexity of Finding Embeddings in a k-Tree
• Computing the characteristic polynomial of threshold graphs
• Eigenvalue location in cographs
• Eigenvalue location in graphs of small clique-width
• Eigenvalue location in threshold graphs
• Eigenvalues and energy in threshold graphs
• Every totally real algebraic integer is a tree eigenvalue
• Graph minors. I. Excluding a forest
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 1823807 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• scientific article; zbMATH DE number 2235064 (Why is no real title available?)
• Indices for special classes of trees
• Integral cographs
• Laplacian energy of diameter 3 trees
• Locating eigenvalues in graphs. Algorithms and applications
• Locating eigenvalues of unbalanced unicyclic signed graphs
• Locating eigenvalues of unicyclic graphs
• Locating the eigenvalues for graphs of small clique-width
• Locating the eigenvalues of trees
• Matrix multiplication via arithmetic progressions
• Most Laplacian eigenvalues of a tree are small
• Nonserial dynamic programming
• On a conjecture for the sum of Laplacian eigenvalues
• On Quipus whose signless Laplacian index does not exceed 4.5
• On the distribution of Laplacian eigenvalues of trees
• On the distribution of the maximum eigenvalues of graphs
• On the number of Laplacian eigenvalues of trees less than the average degree
• On the spectrum of threshold graphs
• On the sum of the Laplacian eigenvalues of a tree
• Polynomial-time recognition of clique-width 3 graphs
• Relative bilinear complexity and matrix multiplication.
• S-functions for graphs
• Some notes on spectra of cographs.
• Some spectral properties of cographs
• Spectral ordering of trees with small index
• Spectral properties of cographs and P₅-free graphs
• Spectral radius ordering of starlike trees
• Trees with 4 or 5 distinct normalized Laplacian eigenvalues
• Treewidth computations. I: Upper bounds
• Treewidth computations. II. Lower bounds
• Treewidth. Computations and approximations
• Upper bounds to the clique width of graphs

Cited in

(1)

• Graphs whose spectral radius is bounded by a fixed Hoffman-Smith limit point

This page was built for publication: Locating Eigenvalues of Symmetric Matrices - A Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198240)