Lihua Feng, Qiao Li, Xiao‐Dong Zhang
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.
OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Mathematics, Spectral radius, Combinatorics, Matching (statistics), RADIUS, Laplace operator, Tree (set theory), Set (abstract data type)