Resource title

Graphs with given degree sequence and maximal spectral radius

Resource image

image for OpenScout resource :: Graphs with given degree sequence and maximal spectral radius

Resource description

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

Resource author

Türker Biyikoglu, Josef Leydold

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

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

Resource license

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