Geodesic
Graphs with given degree sequence and maximal spectral radius
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
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.
DOI : 10.37236/843
Classification : 05C75, 05C07, 05C50
Mots-clés : largest spectral radius, connected graphs, degree sequence, breadth first search 
Türker Bıyıkoğlu; Josef Leydold. Graphs with given degree sequence and maximal spectral radius. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/843
@article{10_37236_843,
     author = {T\"urker B{\i}y{\i}ko\u{g}lu and Josef Leydold},
     title = {Graphs with given degree sequence and maximal spectral radius},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/843},
     zbl = {1165.05340},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/843/}
}
TY  - JOUR
AU  - Türker Bıyıkoğlu
AU  - Josef Leydold
TI  - Graphs with given degree sequence and maximal spectral radius
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/843/
DO  - 10.37236/843
ID  - 10_37236_843
ER  - 
%0 Journal Article
%A Türker Bıyıkoğlu
%A Josef Leydold
%T Graphs with given degree sequence and maximal spectral radius
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/843/
%R 10.37236/843
%F 10_37236_843

Cité par Sources :