Perron value and moment of rooted trees
From MaRDI portal
Publication:2062813
DOI10.1016/j.laa.2021.11.004zbMath1479.05195arXiv2105.03466OpenAlexW3212722539MaRDI QIDQ2062813
Publication date: 3 January 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.03466
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Spectra of graphs
- Tight bounds on the algebraic connectivity of Bethe trees
- On the algebraic connectivity of graphs as a function of genus
- Eigenvalues and expanders
- Combinatorial Perron parameters for trees
- The Braess' paradox for pendent twins
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- Theory of monomer-dimer systems
- Isoperimetric numbers of graphs
- An upper bound on algebraic connectivity of graphs with many cutpoints
- Sines and Cosines of Angles in Arithmetic Progression
- Characteristic vertices of weighted trees via perron values
- Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
- A new graph product and its spectrum
- Perron components and algebraic connectivity for weighted graphs
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Kemeny's Constant and the Random Surfer
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Combinatorial Perron values of trees and bottleneck matrices
- On trees with maximum algebraic connectivity
This page was built for publication: Perron value and moment of rooted trees
