Graphs with given degree sequence and maximal spectral radius (Q1010854)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5541024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with given degree sequence and maximal spectral radius |
scientific article; zbMATH DE number 5541024 |
Statements
Graphs with given degree sequence and maximal spectral radius (English)
0 references
7 April 2009
0 references
Summary: 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.
0 references
largest spectral radius
0 references
connected graphs
0 references
degree sequence
0 references
breadth first search
0 references
0.95728016
0 references
0.9501599
0 references
0.9451846
0 references
0.93494546
0 references
0.9238711
0 references
0.9225312
0 references
0.92060715
0 references
