arXiv Analytics

Sign in

arXiv:2105.03466 [math.CO]AbstractReferencesReviewsResources

Perron value and moment of rooted trees

Lorenzo Ciardo

Published 2021-05-07Version 1

The Perron value $\rho(T)$ of a rooted tree $T$ has a central role in the study of the algebraic connectivity and characteristic set, and it can be considered a weight of spectral nature for $T$. A different, combinatorial weight notion for $T$ - the moment $\mu(T)$ - emerges from the analysis of Kemeny's constant in the context of random walks on graphs. In the present work, we compare these two weight concepts showing that $\mu(T)$ is "almost" an upper bound for $\rho(T)$ and the ratio $\mu(T)/\rho(T)$ is unbounded but at most linear in the order of $T$. To achieve these primary goals, we introduce two new objects associated with $T$ - the Perron entropy and the neckbottle matrix - and we investigate how different operations on the set of rooted trees affect the Perron value and the moment.

Comments: 19 pages, 3 figures
Categories: math.CO
Subjects: 05C50, 05C76, 05C05, 15A18, 05C81
Related articles: Most relevant | Search more
arXiv:2407.02535 [math.CO] (Published 2024-07-01)
Eccentricity and algebraic connectivity of graphs
arXiv:2308.06040 [math.CO] (Published 2023-08-11)
Algebraic connectivity of Kronecker products of line graphs
arXiv:math/0109191 [math.CO] (Published 2001-09-24)
A Heawood-type result for the algebraic connectivity of graphs on surfaces