The minimal Laplacian spectral radius of trees with given matching number

DOI10.1080/03081087.2013.770849zbMath1286.05092OpenAlexW1990604984MaRDI QIDQ5409954

Wei Li, An Chang

Publication date: 15 April 2014

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

Full work available at URL: https://doi.org/10.1080/03081087.2013.770849

zbMATH Keywords

matching numberLaplacian spectral radiusunit eigenvector

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (3)

Matchings in graphs from the spectral radius ⋮ Maximum matchings of a digraph based on the largest geometric multiplicity ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number

Cites Work

• Unnamed Item
• On the Laplacian spectral radius of a tree.
• Trees with maximum nullity
• The Laplacian Spectrum of a Graph
• Minimizing the Laplacian spectral radius of trees with given matching number

This page was built for publication: The minimal Laplacian spectral radius of trees with given matching number