Laplacian spectral radius and maximum degree of trees with perfect matchings

DOI10.1007/s00373-012-1205-8zbMath1272.05108MaRDI QIDQ367081

Xiaodan Chen, Jian Guo Qian

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1205-8

zbMATH Keywords

tree; perfect matching; maximum degree; Laplacian spectral radius

Mathematics Subject Classification ID

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

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• On the Laplacian spectral radius of trees with fixed diameter
• The Laplacian spectral radii of trees with degree sequences
• Laplacian spectral radius of trees with given maximum degree
• On the Laplacian spectral radii of trees with perfect matchings
• On the Laplacian spectral radii of trees
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• On the Laplacian spectral radius of a tree.
• On the largest eigenvalue of a tree with perfect matchings
• On the second largest Laplacian eigenvalue of trees
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees