@techreport{ad74d70c94e3489e8181b07981115834,

title = "Largest Laplacian Eigenvalue and Degree Sequences of Trees",

abstract = "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)",

author = "T{\"u}rker Biyikoglu and Marc Hellmuth and Josef Leydold",

year = "2008",

language = "English",

series = "Research Report Series / Department of Statistics and Mathematics",

publisher = "Department of Statistics and Mathematics, WU Vienna University of Economics and Business",

number = "64",

edition = "April 2008",

type = "WorkingPaper",

institution = "Department of Statistics and Mathematics, WU Vienna University of Economics and Business",

}