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

We characterize trees that have greatest maximum p-Laplacian eigen- value among all trees with a given degree sequence. We show 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$.