Locating the eigenvalues of trees

DOI10.1016/j.laa.2010.08.006zbMath1231.05167OpenAlexW1982642689MaRDI QIDQ609482

Vilmar Trevisan, David P. Jacobs

Publication date: 1 December 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.08.006

zbMATH Keywords

eigenvaluestreescaterpillarsSylvester's Law of Inertia

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (31)

Locating eigenvalues of unicyclic graphs ⋮ Eigenvalue location in graphs of small clique-width ⋮ Ordering starlike trees by the totality of their spectral moments ⋮ On Quipus whose signless Laplacian index does not exceed 4.5 ⋮ Diagonalization of generalized lollipop graphs ⋮ On the eigenvalues and spectral radius of starlike trees ⋮ On the distribution of Laplacian eigenvalues of trees ⋮ Spectral ordering of trees with small index ⋮ On a conjecture of Laplacian energy of trees ⋮ Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic ⋮ The characterization of the minimal weighted acyclic graphs ⋮ Graphs sharing an arbitrary number of ordered complementarity eigenvalues ⋮ Diminimal families of arbitrary diameter ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ 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 ⋮ Unnamed Item ⋮ Most Laplacian eigenvalues of a tree are small ⋮ Integral unicyclic graphs ⋮ Spectral radius ordering of starlike trees ⋮ A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization ⋮ Locating eigenvalues of unbalanced unicyclic signed graphs ⋮ Unicyclic graphs with equal Laplacian energy ⋮ Eigenvalue location in cographs ⋮ Applications of rational difference equations to spectral graph theory ⋮ Trees with 4 or 5 distinct normalized Laplacian eigenvalues ⋮ Majorization and the spectral radius of starlike trees ⋮ Domination and Spectral Graph Theory ⋮ On the number of Laplacian eigenvalues of trees less than the average degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The spectra of some trees and bounds for the largest eigenvalue of any tree
• On a Diophantine equation arising in graph theory
• The determinant of a tree's neighborhood matrix
• The distribution of eigenvalues of graphs
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
• Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
• The Largest Eigenvalue of Sparse Random Graphs

This page was built for publication: Locating the eigenvalues of trees