Algebraic Connectivity and Degree Sequences of Trees
Combinatorics
2008-10-07 v1 Spectral Theory
Abstract
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.
Cite
@article{arxiv.0810.0966,
title = {Algebraic Connectivity and Degree Sequences of Trees},
author = {Tuerker Biyikoglu and Josef Leydold},
journal= {arXiv preprint arXiv:0810.0966},
year = {2008}
}
Comments
8 pages