Largest Laplacian Eigenvalue and Degree Sequences of Trees

Simple item page
dc.creatorBiyikoglu, Tuerker
dc.creatorHellmuth, Marc
dc.creatorLeydold, Josef
dc.date2008-04-17
dc.date.accessioned2026-07-07T09:33:11Z
dc.date.available2026-07-07T09:33:11Z
dc.descriptionWe 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.
dc.description9 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0804.2776
dc.identifierhttp://arxiv.org/abs/0804.2776
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159042
dc.subjectCombinatorics
dc.subject05C35; 05C75; 05C05; 05C50
dc.titleLargest Laplacian Eigenvalue and Degree Sequences of Trees
dc.typetext

Files

Collections

arXiv