Bıyıkoğlu, TürkerLeydold, Josef2015-01-152015-01-152009-01-15Bıyıkoğlu, T., & Leydold, J. (2009). Algebraic connectivity and degree sequences of trees. Linear Algebra and its Applications, 430(2), 811-817. doi:10.1016/j.laa.2008.09.0300024-37951873-1856https://hdl.handle.net/11729/342http://dx.doi.org/10.1016/j.laa.2008.09.030We 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.eninfo:eu-repo/semantics/closedAccessAlgebraic connectivityGraph LaplacianTreeFiedler vectorDirichlet matrixDegree sequenceGraph in graph theorySignless LaplacianGraphsArticle4302-3811817Q2Q2WOS:0002615471000212-s2.0-5554912678710.1016/j.laa.2008.09.030Q1