Ordering trees by their largest eigenvalues

DOI10.1016/J.LAA.2006.02.035zbMATH Open1106.05029OpenAlexW2012343240MaRDI QIDQ5898283

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

spectral radiuscharacteristic polynomial

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The second largest eigenvalue of a tree
• Eigenspaces of graphs
• Bounds on the \(k\)th eigenvalues of trees and forests
• On the largest eigenvalue of a tree with perfect matchings
• On the spectral radius of trees
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Ordering trees by their largest eigenvalues
• On the two largest eigenvalues of trees
• Improved bounds for the largest eigenvalue of trees

Cited In (23)

• More on the Estrada indices of trees
• Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
• Ordering trees by their distance spectral radii
• On distance Laplacian spectral ordering of some graphs
• Some results on the spectral radii of bicyclic graphs
• The minimum spectral radius of graphs with a given independence number
• Title not available (Why is that?)
• Ordering trees by \(\alpha\)-index
• On spectral irregularity of graphs
• Reciprocal distance Laplacian spectral properties double stars and their complements
• Characterizing trees with large Laplacian energy
• Absolute algebraic connectivity of double brooms and trees
• The minimum spectral radius of graphs with a given domination number
• On the extremal properties of the average eccentricity
• On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree
• On the largest eigenvalues of trees with perfect matchings
• Ordering trees and graphs with few cycles by algebraic connectivity
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
• The first mixed eigenvalues of \(p\)-Laplacian on trees
• A note on (signless) Laplacian spectral ordering with maximum degrees of graphs
• Spectral norm of oriented graphs
• The multiplicity of eigenvalues of trees
• Ordering graphs by their largest (least) A_α-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)