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

Graphs with given degree sequence and maximal spectral radius

Biyikoglu, Türker and Leydold, Josef (2008) Graphs with given degree sequence and maximal spectral radius. Research Report Series / Department of Statistics and Mathematics, 72. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

Download (143Kb) | Preview


We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of the vertices induced by breadth-first search. For trees the resulting structure is uniquely determined up to isomorphism. We also show that the largest spectral radius in such classes of trees is strictly monotone with respect to majorization. This paper is the revised final version of the preprint no. 35 of this research report series. (author´s abstract)

Item Type: Paper
Keywords: adjacency matrix / eigenvectors / spectral radius / degree sequence / Perron vector / tree / majorization
Classification Codes: MSC 05C35, 05C75, 05C05
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 06 Oct 2008 15:18
Last Modified: 11 Jun 2015 06:38
URI: http://epub.wu.ac.at/id/eprint/1160


View Item