Graphs with given degree sequence and maximal spectral radius
Yükleniyor...
Dosyalar
Tarih
2008-09-15
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Electronic Journal of Combinatorics
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Adjacency Matrix, Eigenvectors, Spectral Radius, Degree Sequence, Perron Vector, Tree, Majorization, Graph in graph theory, Signless Laplacian, Algebraic connectivity, Largest eigenvalue, Inequality, Bounds, Index
Kaynak
Electronic Journal of Combinatorics
WoS Q Değeri
Q2
Scopus Q Değeri
Q2
Cilt
15
Sayı
1
Künye
Bıyıkoǧlu, T. & Leydold, J. (2008). Graphs with given degree sequence and maximal spectral radius. Electronic Journal of Combinatorics, 15(1), 1-9.
