Ordering trees with nearly perfect matchings by algebraic connectivity
From MaRDI portal
Publication:926016
DOI10.1007/s11401-006-0558-9zbMath1138.05320MaRDI QIDQ926016
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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Absolute algebraic connectivity of double brooms and trees, On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering, Ordering trees and graphs with few cycles by algebraic connectivity, Algebraic connectivity on a subclass of caterpillars
Cites Work