2024/01/18 by Biyikoglu, Türker, Leydold, Josef
paper · doi:10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0
We 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. (author´s abstract)