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

Türker Biyikoglu, Marc Hellmuth, Josef Leydold

Publication: Working/Discussion PaperWU Working Paper

Abstract

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.
Original languageEnglish
Publication statusPublished - 1 May 2009

Publication series

NameResearch Report Series / Department of Statistics and Mathematics
No.85

WU Working Paper Series

  • Research Report Series / Department of Statistics and Mathematics

Cite this