Algebraic Connectivity and Degree Sequences of Trees
classification
🧮 math.CO
math.SP
keywords
treesalgebraicconnectivitydegreecaterpillarscharacteristicdegreesevery
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.