Return to search

Graphs with given degree sequence and maximal spectral radius

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) / Series: Research Report Series / Department of Statistics and Mathematics

Identiferoai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_dff
Date January 2008
CreatorsBiyikoglu, Türker, Leydold, Josef
PublisherDepartment of Statistics and Mathematics, WU Vienna University of Economics and Business
Source SetsWirtschaftsuniversität Wien
LanguageEnglish
Detected LanguageEnglish
TypePaper, NonPeerReviewed
Formatapplication/pdf
Relationhttp://epub.wu.ac.at/1160/

Page generated in 0.002 seconds