Graphs with given degree sequence and maximal spectral radius (Q1010854)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Graphs with given degree sequence and maximal spectral radius
scientific article

    Statements

    Graphs with given degree sequence and maximal spectral radius (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references