Publikationen pro Jahr
Publikationen pro Jahr
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.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 811 - 817 |
| Fachzeitschrift | Linear Algebra and Its Applications |
| Jahrgang | 430 |
| Ausgabenummer | 2-3 |
| Publikationsstatus | Veröffentlicht - 1 Apr. 2009 |
Andere Versionen dieses Inhalts
- 1 WU Working Paper
-
Algebraic Connectivity and Degree Sequences of Trees
Biyikoglu, T. & Leydold, J., 2008, Sept. 2008 Aufl., Vienna: Department of Statistics and Mathematics, WU Vienna University of Economics and Business, (Research Report Series / Department of Statistics and Mathematics; Nr. 73).Publikation: Working/Discussion Paper › WU Working Paper
Open AccessDatei82 Downloads (Pure)