1 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 1 / 1
Yayın Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences(Int Linear Algebra Soc, 2009-03) Bıyıkoğlu, Türker; Hellmuth, Marc; Leydold, JosefTrees 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.
