2024/01/18 by Biyikoglu, Türker, Hellmuth, Marc, Leydold, Josef
paper · doi:10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256
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.