On the second largest Laplacian eigenvalue of trees

DOI10.1016/j.laa.2005.02.031zbMath1066.05085MaRDI QIDQ2484395

Ji-Ming Guo

Publication date: 1 August 2005

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

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

zbMATH Keywords

Characteristic polynomial; Perfect matching

Mathematics Subject Classification ID

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

Related Items

Laplacian spectral radius and maximum degree of trees with perfect matchings, On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs, The smallest Laplacian spectral radius of graphs with a given clique number, The Laplacian spectral radius of trees and maximum vertex degree, The smallest values of algebraic connectivity for unicyclic graphs, The algebraic connectivity of lollipop graphs, On the Laplacian coefficients of trees with a perfect matching, On the second Laplacian eigenvalues of trees of odd order, On the Laplacian spectral radius of trees with fixed diameter, On limit points of Laplacian spectral radii of graphs, On the Laplacian spectral radii of trees with nearly perfect matchings, On the Laplacian spectral radii of bicyclic graphs, A conjecture on the algebraic connectivity of connected graphs with fixed girth, The Laplacian spectral radius of a graph under perturbation, Some results on the Laplacian eigenvalues of unicyclic graphs, On the Laplacian spectral radii of trees with perfect matchings, On the Laplacian spectral radii of trees, The ordering of unicyclic graphs with the smallest algebraic connectivity, The smallest values of algebraic connectivity for trees, On the second largest Laplacian eigenvalues of graphs, The six classes of trees with the largest algebraic connectivity, The ordering of trees and connected graphs by algebraic connectivity, On a Poset of Trees II, On the multiplicity of laplacian eigenvalues of graphs, On the Laplacian spectral radius of weighted trees with fixed diameter and weight set

Cites Work

• Unnamed Item
• Bounds on the \(k\)th eigenvalues of trees and forests
• On the Laplacian spectral radius of a tree.
• On trees with perfect matchings
• The third smallest eigenvalue of the Laplacian matrix
• Lower bounds on the third smallest laplacian eigenvalue of a graph
• The Laplacian Spectrum of a Graph
• Ordering trees by algebraic connectivity