Combinatorial Perron values of trees and bottleneck matrices
From MaRDI portal
Publication:4603776
DOI10.1080/03081087.2016.1274363zbMATH Open1387.15008OpenAlexW2561390589MaRDI QIDQ4603776FDOQ4603776
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
Cites Work
- Inequalities: theory of majorization and its applications
- Eigenvalues and expanders
- The Laplacian Spectrum of a Graph II
- Combinatorial matrix theory
- Isoperimetric numbers of graphs
- Old and new results on algebraic connectivity of graphs
- On graphs with equal algebraic and vertex connectivity
- Introduction to Partial Differential Equations
- Characteristic vertices of weighted trees via perron values
- Algebraic connectivity of weighted trees under perturbation
- On trees with maximum algebraic connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- A Fiedler center for graphs generalizing the characteristic set
- Combinatorial Perron parameters for trees
- Inverse Perron values and connectivity of a uniform hypergraph
- Schur reduction of trees and extremal entries of the Fiedler vector
- Perron value and moment of rooted trees
- Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
- Perron values and classes of trees
- A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
- Combinatorial Fiedler theory and graph partition
This page was built for publication: Combinatorial Perron values of trees and bottleneck matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603776)
