Combinatorial Perron parameters for trees
From MaRDI portal
Publication:1736239
DOI10.1016/J.LAA.2018.12.028zbMATH Open1410.15019OpenAlexW2907711226WikidataQ128686742 ScholiaQ128686742MaRDI QIDQ1736239FDOQ1736239
Authors: 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
Recommendations
Cites Work
- Inequalities: theory of majorization and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Majorization and distances in trees
- Title not available (Why is that?)
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Title not available (Why is that?)
- Characteristic vertices of trees*
- 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
- Ordering trees by algebraic connectivity
- Combinatorial Perron values of trees and bottleneck matrices
Cited In (9)
- A Fiedler center for graphs generalizing the characteristic set
- Title not available (Why is that?)
- Invariants for incidence matrix of a tree
- Perron value and moment of rooted trees
- Perron values and classes of trees
- Constructions for type I trees with nonisomorphic Perron branches
- Combinatorial Perron values of trees and bottleneck matrices
- Combinatorial Fiedler theory and graph partition
- Title not available (Why is that?)
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)
