Quotation Biyikoglu, Türker, Leydold, Josef. 2009. Algebraic Connectivity and Degree Sequences of Trees. Linear Algebra and its Applications 430 (2-3): 811-817.


RIS


BibTeX

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.

Tags

Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation WU
Type of publication Journal article
Journal Linear Algebra and its Applications
Citation Index SCI
WU Journalrating 2009 A
Language English
Title Algebraic Connectivity and Degree Sequences of Trees
Volume 430
Number 2-3
Year 2009
Page from 811
Page to 817
Reviewed? Y
URL http://epub.wu-wien.ac.at/dyn/virlib/wp/eng/mediate/epub-wu-01_dfe.pdf?ID=epub-wu-01_dfe

Associations

People
Leydold, Josef (Details)
External
Biyikoglu, Türker (Turkey)
Organization
Institute for Statistics and Mathematics IN (Details)
Research Institute for Computational Methods FI (Details)
Google Scholar: Search