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. (author´s abstract) / Series: Research Report Series / Department of Statistics and Mathematics
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_dfe |
| Date | January 2008 |
| Creators | Biyikoglu, Türker, Leydold, Josef |
| Publisher | Department of Statistics and Mathematics, WU Vienna University of Economics and Business |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Paper, NonPeerReviewed |
| Format | application/pdf |
| Relation | http://epub.wu.ac.at/782/ |
Page generated in 0.002 seconds