Combinatorial Perron parameters for trees

DOI10.1016/J.LAA.2018.12.028zbMath1410.15019OpenAlexW2907711226WikidataQ128686742 ScholiaQ128686742MaRDI QIDQ1736239

Enide Andrade, Lorenzo Ciardo, Geir Dahl

Publication date: 26 March 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://urn.nb.no/URN:NBN:no-74446

zbMATH Keywords

treeLaplacian matrixmajorizationPerron valuebottleneck matrix

Mathematics Subject Classification ID

Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (4)

Combinatorial Fiedler theory and graph partition ⋮ Perron value and moment of rooted trees ⋮ Perron values and classes of trees ⋮ A Fiedler center for graphs generalizing the characteristic set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering trees and graphs with few cycles by algebraic connectivity
• Characteristic vertices of weighted trees via perron values
• Algebraic connectivity of weighted trees under perturbation
• Combinatorial Perron values of trees and bottleneck matrices
• Majorization and distances in trees
• Inequalities: theory of majorization and its applications
• Characteristic vertices of trees^*
• Ordering trees by algebraic connectivity

This page was built for publication: Combinatorial Perron parameters for trees