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.
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.
| Original language | English |
|---|---|
| Pages (from-to) | 811 - 817 |
| Journal | Linear Algebra and Its Applications |
| Volume | 430 |
| Issue number | 2-3 |
| Publication status | Published - 1 Apr 2009 |
Other versions
- 1 WU Working Paper and Case
-
Algebraic Connectivity and Degree Sequences of Trees
Biyikoglu, T. & Leydold, J., 2008, Sept. 2008 ed., Vienna: Department of Statistics and Mathematics, WU Vienna University of Economics and Business, (Research Report Series / Department of Statistics and Mathematics; No. 73).Publication: Working/Discussion Paper › WU Working Paper and Case
Open AccessFile103 Downloads (Pure)
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver