Semiregular Trees with Minimal Laplacian Spectral Radius

Türker Biyikoglu; Josef Leydold

doi:10.1016/j.laa.2009.06.014

Semiregular Trees with Minimal Laplacian Spectral Radius

Türker Biyikoglu, Josef Leydold

Institute for Statistics and Mathematics

Publication: Scientific journal › Journal article › peer-review

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
Pages (from-to)	2335 - 2341
Journal	Linear Algebra and Its Applications
Volume	432
Issue number	9
DOIs	https://doi.org/10.1016/j.laa.2009.06.014
Publication status	Published - 1 Mar 2010

Austrian Classification of Fields of Science and Technology (ÖFOS)

101012 Combinatorics

Access to Document

10.1016/j.laa.2009.06.014Licence: Unspecified

Check availability

University Library Catalogue

7 Citations
1 WU Working Paper

Semiregular Trees with Minimal Laplacian Spectral Radius
Biyikoglu, T. & Leydold, J., 1 Oct 2009, (Research Report Series / Department of Statistics and Mathematics; No. 93).
Publication: Working/Discussion Paper › WU Working Paper

Open Access
File

28 Downloads (Pure)

Cite this

@article{ec86e764f0db47a3b692e7d5970f1705,

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 = "2010",

month = mar,

day = "1",

doi = "10.1016/j.laa.2009.06.014",

language = "English",

volume = "432",

pages = "2335 -- 2341",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "9",

}

TY - JOUR

T1 - Semiregular Trees with Minimal Laplacian Spectral Radius

AU - Biyikoglu, Türker

AU - Leydold, Josef

PY - 2010/3/1

Y1 - 2010/3/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.

U2 - 10.1016/j.laa.2009.06.014

DO - 10.1016/j.laa.2009.06.014

M3 - Journal article

SN - 0024-3795

VL - 432

SP - 2335

EP - 2341

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

IS - 9

ER -

Semiregular Trees with Minimal Laplacian Spectral Radius

Abstract

Austrian Classification of Fields of Science and Technology (ÖFOS)

Access to Document

Check availability

Other versions

Semiregular Trees with Minimal Laplacian Spectral Radius

Cite this