On the largest eigenvalue of a tree with perfect matchings

DOI10.1016/S0012-365X(02)00746-XzbMath1029.05094OpenAlexW2053708463MaRDI QIDQ1402067

An Chang

Publication date: 19 August 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00746-x

zbMATH Keywords

EigenvalueCharacteristic polynomialUpper boundTreePerfect matching

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)

Related Items (11)

Laplacian spectral radius and maximum degree of trees with perfect matchings ⋮ On a conjecture for the signless Laplacian spectral radius of cacti with given matching number ⋮ On the spectral radius of unicyclic graphs with perfect matchings ⋮ Spectral radius of \(r\)-uniform supertrees with perfect matchings ⋮ Ordering trees by their largest eigenvalues ⋮ On the spectral radius of cacti withk-pendant vertices ⋮ Ordering trees by their largest eigenvalues ⋮ On the Laplacian spectral radii of bipartite graphs ⋮ On the largest eigenvalues of trees with perfect matchings ⋮ On the Laplacian spectral radii of trees with perfect matchings ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number

This page was built for publication: On the largest eigenvalue of a tree with perfect matchings