We characterize trees that have greatest maximum p-Laplacian eigenvalue 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.
|Publication status||Published - 1 May 2009|
|Name||Research Report Series / Department of Statistics and Mathematics|
- Research Report Series / Department of Statistics and Mathematics