TY - UNPB
T1 - Graphs With Given Degree Sequence and Maximal Spectral Radius
AU - Biyikoglu, Türker
AU - Leydold, Josef
PY - 2008/10/1
Y1 - 2008/10/1
N2 - 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.
AB - 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.
U2 - 10.57938/320c7b8e-b7b1-420c-b11d-652dc15a1a0e
DO - 10.57938/320c7b8e-b7b1-420c-b11d-652dc15a1a0e
M3 - WU Working Paper and Case
T3 - Research Report Series / Department of Statistics and Mathematics
BT - Graphs With Given Degree Sequence and Maximal Spectral Radius
ER -