Ordering trees with nearly perfect matchings by algebraic connectivity

DOI10.1007/s11401-006-0558-9zbMath1138.05320OpenAlexW1969401960MaRDI QIDQ926016

Elsie Sterbin Gottlieb

Publication date: 26 May 2008

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11401-006-0558-9

zbMATH Keywords

treeLaplacian eigenvaluealgebraic connectivitynearly perfect matching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Absolute algebraic connectivity of double brooms and trees ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characteristic vertices of weighted trees via perron values
• Eigenvectors of acyclic matrices
• Algebraic connectivity and the characteristic set of a graph
• Characteristic vertices of trees^*
• Ordering trees by algebraic connectivity

This page was built for publication: Ordering trees with nearly perfect matchings by algebraic connectivity