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

Largest Laplacian Eigenvalue and Degree Sequences of Trees

Biyikoglu, Türker and Hellmuth, Marc and Leydold, Josef (2008) Largest Laplacian Eigenvalue and Degree Sequences of Trees. Research Report Series / Department of Statistics and Mathematics, 64. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

Download (144Kb) | Preview


We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the vertices that is obtained by breadth-first search. This structure is uniquely determined up to isomorphism. We also show that the maximum eigenvalue in such classes of trees is strictly monotone with respect to majorization. (author´s abstract)

Item Type: Paper
Keywords: graph Laplacian / largest eigenvalue / spectral radius / eigenvector / tree / degree sequence / majorization
Classification Codes: MSC 05C35, 05C75, 05C05, 05C50
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 17 Apr 2008 13:04
Last Modified: 20 Jun 2011 07:34
URI: http://epub.wu.ac.at/id/eprint/350


View Item