Combinatorial Perron values of trees and bottleneck matrices

DOI10.1080/03081087.2016.1274363zbMath1387.15008OpenAlexW2561390589MaRDI QIDQ4603776

Geir Dahl, Enide Andrade

Publication date: 19 February 2018

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

Full work available at URL: http://hdl.handle.net/10852/55336

zbMATH Keywords

treeLaplacian matrixmajorizationPerron valuebottleneck matrix

Mathematics Subject Classification ID

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

Related Items (7)

Inverse Perron values and connectivity of a uniform hypergraph ⋮ Schur reduction of trees and extremal entries of the Fiedler vector ⋮ Combinatorial Fiedler theory and graph partition ⋮ Combinatorial Perron parameters for trees ⋮ 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
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Eigenvalues and expanders
• Isoperimetric numbers of graphs
• Characteristic vertices of weighted trees via perron values
• The Laplacian Spectrum of a Graph II
• Algebraic connectivity of weighted trees under perturbation
• Introduction to Partial Differential Equations
• On trees with maximum algebraic connectivity
• Inequalities: theory of majorization and its applications
• On graphs with equal algebraic and vertex connectivity

This page was built for publication: Combinatorial Perron values of trees and bottleneck matrices