Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues

DOI10.1016/j.disc.2007.08.077zbMath1225.05164OpenAlexW2063761348MaRDI QIDQ942089

Shu-Guang Guo

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.077

zbMATH Keywords

treespectral radiusLaplacian eigenvaluesmatching number

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Absolute algebraic connectivity of double brooms and trees ⋮ Characterizing trees with large Laplacian energy ⋮ On the signless Laplacian index of unicyclic graphs with fixed diameter ⋮ On ordering bicyclic graphs with respect to the Laplacian spectral radius ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ On the Laplacian spectral radius of bipartite graphs with fixed order and size ⋮ Some results on the Laplacian eigenvalues of unicyclic graphs ⋮ The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices

Cites Work

• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• On the Laplacian spectral radius of a tree.
• Sharp upper bounds for the Laplacian graph eigenvalues
• Ordering trees by their Laplacian spectral radii
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues