Combinatorial Perron values of trees and bottleneck matrices
From MaRDI portal
Publication:4603776
Recommendations
Cites work
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Algebraic connectivity of weighted trees under perturbation
- An introduction to the theory of graph spectra
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Characteristic vertices of weighted trees via perron values
- Combinatorial matrix theory
- Eigenvalues and expanders
- Inequalities: theory of majorization and its applications
- Introduction to Partial Differential Equations
- Isoperimetric numbers of graphs
- Old and new results on algebraic connectivity of graphs
- On graphs with equal algebraic and vertex connectivity
- On trees with maximum algebraic connectivity
- The Laplacian Spectrum of a Graph II
Cited in
(9)- Perron value and moment of rooted trees
- Inverse Perron values and connectivity of a uniform hypergraph
- Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
- Perron values and classes of trees
- Combinatorial Perron parameters for trees
- A Fiedler center for graphs generalizing the characteristic set
- Combinatorial Fiedler theory and graph partition
- A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
- Schur reduction of trees and extremal entries of the Fiedler vector
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)