Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
Yükleniyor...
Dosyalar
Tarih
2009-03
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Int Linear Algebra Soc
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence are characterized. It is shown that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.
Açıklama
Anahtar Kelimeler
Degree sequence, Discrete p-laplacian, Eigenvector, Graph in graph theory, Graphs, Hyperbolicity, Hyperbolicity constant, Largest eigenvalue, Majorization, Regularization, Tree
Kaynak
Electronic Journal of Linear Algebra
WoS Q Değeri
Q3
Scopus Q Değeri
Q2
Cilt
18
Sayı
Künye
Bıyıkoǧlu, T., Hellmuth, M. & Leydold, J. (2009). Largest eigenvalues of the discrete p-laplacian of trees with degree sequences. Electronic Journal of Linear Algebra, 18, 202-210.
