Abstract
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.
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.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | R - 119 |
| Fachzeitschrift | Electronic Journal of Combinatorics |
| Jahrgang | 15 |
| Ausgabenummer | 1 |
| Publikationsstatus | Veröffentlicht - 1 Nov. 2008 |