Largest Eigenvalues of Degree Sequences

We show that amongst all trees with a given degree sequence it is a ball where the vertex degrees decrease with increasing distance from its center that maximizes the spectral radius of the graph (i.e., its adjacency matrix). The resulting Perron vector is decreasing on every path starting from the center of this ball. This result it also connected to Faber-Krahn like theorems for Dirichlet matrices on trees. The above result is extended to connected graphs with given degree sequence. Here we give a necessary condition for a graph that has greatest maximum eigenvalue. Moreover, we show that the greatest maximum eigenvalue is monotone on degree sequences with respect to majorization. (author's abstract). Note: There is a more recent version of this paper available: "Graphs with Given Degree Sequence and Maximal Spectral Radius", Research Report Series / Department of Statistics and Mathematics, no. 72. ; Series: Research Report Series / Department of Statistics and Mathematics

TÃ¼rker Biyikoglu, Josef Leydold

en

application/pdf

http://epub.wu.ac.at/148/1/document.pdf

Adapt according to the license agreement. Always reference the original source and author.