Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/25122
Title: | Combinatorial Perron parameters for trees |
Author: | Andrade, Enide Ciardo, Lorenzo Dahl, Geir |
Keywords: | Perron value Botleneck matrix Tree Laplacian matrix Majorization |
Issue Date: | 1-Apr-2019 |
Publisher: | Elsevier |
Abstract: | The notion of combinatorial Perron value was introduced in [2]. We continue the study of this parameter and also introduce a new parameter πe(M) which gives a new lower bound on the spectral radius of the bottleneck matrix M of a rooted tree. We prove a bound on the approximation error for πe(M). Several properties of these two parameters are shown. These ideas are motivated by the concept of algebraic connectivity. A certain extension property for the combinatorial Perron value is shown and it allows us to define a new center concept for caterpillars. We also compare computationally this new center to the so-called characteristic set, i.e., the center obtained from algebraic connectivity. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/25122 |
DOI: | |
ISSN: | 0024-3795 |
Appears in Collections: | CIDMA - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Combinatorial Perron parameters for trees.pdf | 454.07 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.