Combinatorial Perron parameters for trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2130678 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 4114654 (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
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Characteristic vertices of trees*
- Characteristic vertices of weighted trees via perron values
- Combinatorial Perron values of trees and bottleneck matrices
- Inequalities: theory of majorization and its applications
- Majorization and distances in trees
- Ordering trees and graphs with few cycles by algebraic connectivity
- Ordering trees by algebraic connectivity
Cited in
(9)- scientific article; zbMATH DE number 4187815 (Why is no real title available?)
- Perron value and moment of rooted trees
- Constructions for type I trees with nonisomorphic Perron branches
- Combinatorial Perron values of trees and bottleneck matrices
- Perron values and classes of trees
- Invariants for incidence matrix of a tree
- scientific article; zbMATH DE number 5119884 (Why is no real title available?)
- A Fiedler center for graphs generalizing the characteristic set
- Combinatorial Fiedler theory and graph partition
This page was built for publication: Combinatorial Perron parameters for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736239)