2008/10/06 by Biyikoglu, Tuerker, Leydold, Josef
#05C05 #05C50 #05C75 #Combinatorics (math.CO) #FOS: Mathematics #Spectral Theory (math.SP)
paper · doi:10.48550/arxiv.0810.0966
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.