Minimizing the Laplacian spectral radius of trees with given matching number
Authors:
- 1 March 2007
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 55 (2) , 199-207
Abstract
Let denote the set of trees on n vertices with fixed matching number β. In this article, we prove that if n = kβ +1, k ≥ 2, then the trees which minimize the Laplacian spectral radius over have maximum degree Δ =k, and determine the extremal trees for 1≤ β ≤4.Keywords
This publication has 14 references indexed in Scilit:
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of treesDiscrete Mathematics, 2005
- Trees with maximum nullityLinear Algebra and its Applications, 2005
- On the Laplacian spectral radius of a treeLinear Algebra and its Applications, 2003
- Bounds on the largest eigenvalues of trees with a given size of matchingLinear Algebra and its Applications, 2002
- The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics, 1994
- Nonnegative Matrices in the Mathematical Sciences1994
- The Laplacian Spectrum of a GraphSIAM Journal on Matrix Analysis and Applications, 1990
- Graph Theory1979
- Maximal matchings in graphs with given minimal and maximal degreesMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Graph Theory with Applications1976