Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10773/16673
Título: | Combinatorial Perron values of trees and bottleneck matrices |
Autor: | Andrade, Enide Dahl, Geir |
Palavras-chave: | Perron value bottleneck matrix Laplacian matrix Majorization |
Data: | 2017 |
Editora: | Taylor & Francis |
Resumo: | The algebraic connectivity $a(G)$ of a graph $G$ is an important parameter, defined as the second smallest eigenvalue of the Laplacian matrix of $G$. If $T$ is a tree, $a(T)$ is closely related to the Perron values (spectral radius) of so-called bottleneck matrices of subtrees of $T$. In this setting we introduce a new parameter called the {\em combinatorial Perron value} $\rho_c$. This value is a lower bound on the Perron value of such subtrees; typically $\rho_c$ is a good approximation to $\rho$. We compute exact values of $\rho_c$ for certain special subtrees. Moreover, some results concerning $\rho_c$ when the tree is modified are established, and it is shown that, among trees with given distance vector (from the root), $\rho_c$ is maximized for caterpillars. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/16673 |
DOI: | 10.1080/03081087.2016.1274363 |
ISSN: | 0308-1087 |
Aparece nas coleções: | CIDMA - Artigos OGTCG - Artigos |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Combinatorial Perron values of trees and bottleneck matrices.pdf | 1.78 MB | Adobe PDF |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.