Graphs with given degree sequence and maximal spectral radius

From MaRDI portal
Revision as of 21:14, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1010854

zbMATH Open1165.05340arXivmath/0605294MaRDI QIDQ1010854FDOQ1010854

Türker Bıyıkoğlu, Josef Leydold

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0605294

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)






Cited In (38)


Recommendations





This page was built for publication: Graphs with given degree sequence and maximal spectral radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010854)