Algebraic Connectivity and Degree Sequences of Trees

Türker Biyikoglu, Josef Leydold

Publication: Working/Discussion PaperWU Working Paper

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. (author´s abstract)
Original languageEnglish
Place of PublicationVienna
PublisherDepartment of Statistics and Mathematics, WU Vienna University of Economics and Business
Publication statusPublished - 2008

Publication series

NameResearch Report Series / Department of Statistics and Mathematics
No.73

WU Working Paper Series

  • Research Report Series / Department of Statistics and Mathematics

Cite this