Algebraic Connectivity and Degree Sequences of Trees

Simple item page
dc.creatorBiyikoglu, Tuerker
dc.creatorLeydold, Josef
dc.date2008-10-06
dc.date.accessioned2026-07-07T10:07:50Z
dc.date.available2026-07-07T10:07:50Z
dc.descriptionWe investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on non-pendant vertices starting at the characteristic set of the Fiedler vector.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0810.0966
dc.identifierhttp://arxiv.org/abs/0810.0966
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170784
dc.subjectCombinatorics
dc.subjectSpectral Theory
dc.subject05C75; 05C05; 05C50
dc.titleAlgebraic Connectivity and Degree Sequences of Trees
dc.typetext

Files

Collections

arXiv