Largest Laplacian Eigenvalue and Degree Sequences of Trees

Türker Biyikoglu, Marc Hellmuth, Josef Leydold

Publikation: Working/Discussion PaperWU Working Paper

2 Downloads (Pure)


We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the vertices that is obtained by breadth-first search. This structure is uniquely determined up to isomorphism. We also show that the maximum eigenvalue in such classes of trees is strictly monotone with respect to majorization. (author´s abstract)
HerausgeberDepartment of Statistics and Mathematics, WU Vienna University of Economics and Business
PublikationsstatusVeröffentlicht - 2008


NameResearch Report Series / Department of Statistics and Mathematics

WU Working Paper Reihe

  • Research Report Series / Department of Statistics and Mathematics

Dieses zitieren