Graphs with Given Degree Sequence and Maximal Spectral Radius

Details Graphs with Given Degree Sequence and Maximal Spectral Radius Graphs with Given Degree Sequence and Maximal Spectral Radius

2006-05-11

arxiv.org/abs/math/0605294v3

Electr. J. Comb. 15(1), R119, 2008

Mathematics

Combinatorics

12 pages, 4 figures; revised version. Important change: Theorem 3 (formely Theorem 7) now states (and correctly proofs) the ma

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graphs with Given Degree Sequence and Maximal Spectral Radius does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphs with Given Degree Sequence and Maximal Spectral Radius, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs with Given Degree Sequence and Maximal Spectral Radius will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469666