On trees with perfect matchings
From MaRDI portal
Publication:1863567
DOI10.1016/S0024-3795(02)00454-8zbMath1043.05037MaRDI QIDQ1863567
Michael Neumann, Jason J. Molitierno
Publication date: 11 March 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Trees (05C05) Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
On the spectra of certain rooted trees ⋮ The algebraic connectivity of graphs with given matching number ⋮ Ordering trees with algebraic connectivity and diameter ⋮ On the second largest Laplacian eigenvalue of trees ⋮ On the Laplacian spectral radii of trees with perfect matchings ⋮ On the two conjectures of Graffiti ⋮ On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
Cites Work
- Laplacian matrices of graphs: A survey
- Bounds on the largest eigenvalues of trees with a given size of matching
- The Laplacian Spectrum of a Graph
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
- On a bound on algebraic connectivity: the case of equality
- Unnamed Item
- Unnamed Item
- Unnamed Item
