A service provided by the WU Library and the WU IT-Services

Algebraic Connectivity and Degree Sequences of Trees

Biyikoglu, Türker and Leydold, Josef (2008) Algebraic Connectivity and Degree Sequences of Trees. Research Report Series / Department of Statistics and Mathematics, 73. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
Download (182Kb) | Preview

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. (author´s abstract)

Item Type: Paper
Keywords: algebraic connectivity / graph Laplacian / tree / degree sequence / Fiedler vector / Dirichlet matrix
Classification Codes: MSC 05C75, 05C05, 05C50
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 07 Oct 2008 09:16
Last Modified: 25 Jul 2015 01:08
URI: http://epub.wu.ac.at/id/eprint/782

Actions

View Item