Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences

Main Article Content

Türker Bıyıkoğlu
Marc Hellmuth
Josef Leydold


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.

Article Details


Most read articles by the same author(s)