Algebraic Connectivity and Degree Sequences of Trees

Türker Biyikoglu; Josef Leydold

doi:10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0

Algebraic Connectivity and Degree Sequences of Trees

Türker Biyikoglu, Josef Leydold

Institute for Statistics and Mathematics

Publication: Working/Discussion Paper › WU Working Paper

82 Downloads (Pure)

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 language	English
Place of Publication	Vienna
Publisher	Department of Statistics and Mathematics, WU Vienna University of Economics and Business
DOIs	https://doi.org/10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0
Publication status	Published - 2008

Publication series

Series	Research Report Series / Department of Statistics and Mathematics
Number	73

WU Working Paper Series

Research Report Series / Department of Statistics and Mathematics

Access to Document

10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0Licence: Unspecified

DocumentFinal published version, 183 KBLicence: Unspecified

Check availability

University Library Catalogue

1 Journal article

Algebraic Connectivity and Degree Sequences of Trees
Biyikoglu, T. & Leydold, J., 1 Apr 2009, In: Linear Algebra and Its Applications. 430, 2-3, p. 811 - 817
Publication: Scientific journal › Journal article › peer-review

Cite this

@techreport{98b7c3730a8d4916990a20d14455a0b0,

title = "Algebraic Connectivity and Degree Sequences of Trees",

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)",

author = "T{\"u}rker Biyikoglu and Josef Leydold",

year = "2008",

doi = "10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0",

language = "English",

series = "Research Report Series / Department of Statistics and Mathematics",

number = "73",

publisher = "Department of Statistics and Mathematics, WU Vienna University of Economics and Business",

edition = "Sept. 2008",

type = "WorkingPaper",

institution = "Department of Statistics and Mathematics, WU Vienna University of Economics and Business",

}

TY - UNPB

T1 - Algebraic Connectivity and Degree Sequences of Trees

AU - Biyikoglu, Türker

AU - Leydold, Josef

PY - 2008

Y1 - 2008

N2 - 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)

AB - 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)

U2 - 10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0

DO - 10.57938/98b7c373-0a8d-4916-990a-20d14455a0b0

M3 - WU Working Paper

T3 - Research Report Series / Department of Statistics and Mathematics

BT - Algebraic Connectivity and Degree Sequences of Trees

PB - Department of Statistics and Mathematics, WU Vienna University of Economics and Business

CY - Vienna

ER -

Algebraic Connectivity and Degree Sequences of Trees

Abstract

Publication series

WU Working Paper Series

Access to Document

Check availability

Other versions

Algebraic Connectivity and Degree Sequences of Trees

Cite this