Ordering trees by their largest eigenvalues

DOI10.1016/J.LAA.2006.02.035MaRDI QIDQ5898283zbMATH OpenOpenAlexFDO

Authors Wenshui Lin, Xiaofeng Guo

Publication date 7 December 2006

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

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

zbMATH Keywords

characteristic polynomialspectral radius

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

The paper studies eigenvalues of the adjacency matrices of trees. The paper charterizes which tree uniquely minimizes the largest eigenvalue among trees on \(n\) vertices and maximum degree \(\Delta\), and which tree uniquely maximizes the largest eigenvalue among the same trees for \(\lceil {n-2\over 2}\rceil \leq \Delta\). The paper also determines which \(n\)-vertex tree has the 13th largest eigenvalue among all \(n\)-vertex trees. The paper extends results of \textit{M. Hofmeister} [Linear Algebra Appl. 260, 43--59 (1997; Zbl 0876.05068)] and \textit{A. Chang} and \textit{Q. Huang} [Linear Algebra Appl. 370, 175--184 (2003; Zbl 1030.05029)].

Recommendations

• Ordering trees by their largest eigenvalues
• scientific article; zbMATH DE number 5199182
• Ordering of the largest eigenvalues of trees
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• On the largest eigenvalues of trees with perfect matchings

Cites work

• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Bounds on the \(k\)th eigenvalues of trees and forests
• Eigenspaces of graphs
• scientific article; zbMATH DE number 3737716 (Why is no real title available?)
• scientific article; zbMATH DE number 3783047 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Improved bounds for the largest eigenvalue of trees
• On the largest eigenvalue of a tree with perfect matchings
• On the spectral radius of trees
• On the two largest eigenvalues of trees
• Ordering trees by their largest eigenvalues
• Permanent of the Laplacian matrix of trees and bipartite graphs
• The second largest eigenvalue of a tree

Cited in

(38)

• The minimum spectral radius of graphs with a given independence number
• On the two largest eigenvalues of trees
• The multiplicity of eigenvalues of trees
• Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
• Ordering trees and graphs with few cycles by algebraic connectivity
• Spectral norm of oriented graphs
• Characterizing trees with large Laplacian energy
• Ordering trees by their distance spectral radii
• On a poset of trees. II
• Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
• On the extremal properties of the average eccentricity
• A result related to the largest eigenvalue of a tree
• scientific article; zbMATH DE number 4097428 (Why is no real title available?)
• scientific article; zbMATH DE number 7379064 (Why is no real title available?)
• A note on (signless) Laplacian spectral ordering with maximum degrees of graphs
• Ordering of the largest eigenvalues of trees
• The spectral moments of trees with given maximum degree
• More on the Estrada indices of trees
• Ordering trees with \(n\)-vertices and diameter \(d\) by their largest Laplacian eigenvalues
• On the largest eigenvalues of trees with perfect matchings
• Ordering graphs by their largest (least) A_α-eigenvalues
• Ordering trees by their largest eigenvalues
• Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems
• The minimum spectral radius of graphs with a given domination number
• Ordering trees by -index
• Reciprocal distance Laplacian spectral properties double stars and their complements
• On distance Laplacian spectral ordering of some graphs
• On spectral irregularity of graphs
• The first mixed eigenvalues of \(p\)-Laplacian on trees
• Brualdi-Solheid problem on the minimum spectral radius of graphs with given matching number
• The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights
• Some results on the spectral radii of bicyclic graphs
• On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree
• Domination number, independent number and minimum spectral radius in unicyclic graphs
• On the maximum ABC spectral radius of connected graphs with given maximum degree
• Minimal spectral radius of graphs with given matching number
• Absolute algebraic connectivity of double brooms and trees
• Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues

This page was built for publication: Ordering trees by their largest eigenvalues

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