Algebraic Connectivity and Degree Sequences of Trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on non-pendant vertices starting at the characteristic set of the Fiedler vector.
8 pages

Keywords

Combinatorics, Spectral Theory, 05C75; 05C05; 05C50

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/170784

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0810.0966
 http://arxiv.org/abs/0810.0966

Collections

arXiv