Trees with a large Laplacian eigenvalue multiplicity

Saieed Akbari; Edwin R. van Dam; Mohammadhossein Fakharan

doi:10.1016/j.laa.2019.10.011

Trees with a large Laplacian eigenvalue multiplicity

Saieed Akbari
, Edwin R. van Dam
, Mohammadhossein Fakharan

Research output: Contribution to journal › Article › Scientific › peer-review

3 Citations (Scopus)

Abstract

In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound , and emphasize the particular role of the algebraic connectivity.

Original language	English
Pages (from-to)	262-273
Number of pages	12
Journal	Linear Algebra and its Applications
Volume	586
DOIs	https://doi.org/10.1016/j.laa.2019.10.011
Publication status	Published - Feb 2020

Keywords

Laplacian spectrum
trees
multiplicities of eigenvalues

Access to Document

10.1016/j.laa.2019.10.011

https://arxiv.org/abs/1907.11482

Cite this

@article{6b3e2f95994846dfbc259e42a98288a2,

title = "Trees with a large Laplacian eigenvalue multiplicity",

abstract = "In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound , and emphasize the particular role of the algebraic connectivity.",

keywords = "Laplacian spectrum, trees, multiplicities of eigenvalues",

author = "Saieed Akbari and \{van Dam\}, \{Edwin R.\} and Mohammadhossein Fakharan",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",

year = "2020",

month = feb,

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

language = "English",

volume = "586",

pages = "262--273",

journal = "Linear Algebra and its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Trees with a large Laplacian eigenvalue multiplicity

AU - Akbari, Saieed

AU - van Dam, Edwin R.

AU - Fakharan, Mohammadhossein

PY - 2020/2

Y1 - 2020/2

N2 - In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound , and emphasize the particular role of the algebraic connectivity.

AB - In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound , and emphasize the particular role of the algebraic connectivity.

KW - Laplacian spectrum

KW - trees

KW - multiplicities of eigenvalues

U2 - 10.1016/j.laa.2019.10.011

DO - 10.1016/j.laa.2019.10.011

M3 - Article

SN - 0024-3795

VL - 586

SP - 262

EP - 273

JO - Linear Algebra and its Applications

JF - Linear Algebra and its Applications

ER -

Trees with a large Laplacian eigenvalue multiplicity

Abstract

Keywords

Access to Document

Fingerprint

Cite this