On the largest eigenvalues of trees with perfect matchings

DOI10.1007/s10910-006-9161-2zbMath1217.05147OpenAlexW1981537352MaRDI QIDQ551881

Wenshui Lin, Xiaofeng Guo

Publication date: 21 July 2011

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9161-2

zbMATH Keywords

treeeigenvaluespectral radiusperfect matchingmaximum degree

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 (7)

The Estrada index of chemical trees ⋮ The minimum spectral radius of graphs with a given domination number ⋮ About the type of broom trees ⋮ On the ordering of trees by the Laplacian coefficients ⋮ Unnamed Item ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Topological approach to the chemistry of conjugated molecules
• On the two largest eigenvalues of trees
• On the largest eigenvalue of a tree with perfect matchings
• On the spectral radius of unicyclic graphs with perfect matchings
• On the index of bicyclic graphs with perfect matchings
• On the eigenvalues of trees
• Ordering trees by their largest eigenvalues
• Ordering trees by their largest eigenvalues
• On the spectral radius of trees

This page was built for publication: On the largest eigenvalues of trees with perfect matchings