Semiregular Trees with Minimal Laplacian Spectral Radius

Türker Biyikoglu; Josef Leydold

Semiregular Trees with Minimal Laplacian Spectral Radius

Publication: Working/Discussion Paper › WU Working Paper

Abstract

A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency / Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence.

Original language	English
Publication status	Published - 1 Oct 2009

Publication series

Name	Research Report Series / Department of Statistics and Mathematics
No.	93

WU Working Paper Series

Research Report Series / Department of Statistics and Mathematics

Access to Document

DocumentFinal published version, 165 KBLicence: Other

SFX availability

Full text

1 Journal article

Semiregular Trees with Minimal Laplacian Spectral Radius
Biyikoglu, T. & Leydold, J., 1 Mar 2010, In: Linear Algebra and Its Applications. 432, 9, p. 2335 - 2341
Publication: Scientific journal › Journal article › peer-review

Cite this

@techreport{c9a4a7375e9a4241983d94d1b2dc07ab,

title = "Semiregular Trees with Minimal Laplacian Spectral Radius",

abstract = "A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency / Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence.",

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

year = "2009",

month = oct,

day = "1",

language = "English",

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

number = "93",

type = "WorkingPaper",

}

TY - UNPB

T1 - Semiregular Trees with Minimal Laplacian Spectral Radius

AU - Biyikoglu, Türker

AU - Leydold, Josef

PY - 2009/10/1

Y1 - 2009/10/1

N2 - A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency / Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence.

AB - A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency / Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence.

M3 - WU Working Paper

T3 - Research Report Series / Department of Statistics and Mathematics

BT - Semiregular Trees with Minimal Laplacian Spectral Radius

ER -

Semiregular Trees with Minimal Laplacian Spectral Radius

Abstract

Publication series

WU Working Paper Series

Access to Document

SFX availability

Other versions

Semiregular Trees with Minimal Laplacian Spectral Radius

Cite this