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.

This publication has 14 references indexed in Scilit: