On the multiplicity of Laplacian eigenvalues of graphs
Czechoslovak Mathematical Journal, Tome 60 (2010) no. 3, pp. 689-698
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
In this paper we investigate the effect on the multiplicity of Laplacian eigenvalues of two disjoint connected graphs when adding an edge between them. As an application of the result, the multiplicity of 1 as a Laplacian eigenvalue of trees is also considered.
In this paper we investigate the effect on the multiplicity of Laplacian eigenvalues of two disjoint connected graphs when adding an edge between them. As an application of the result, the multiplicity of 1 as a Laplacian eigenvalue of trees is also considered.
Classification :
05C50
Keywords: Laplacian eigenvalue; multiplicity; tree; characteristic polynomial
Keywords: Laplacian eigenvalue; multiplicity; tree; characteristic polynomial
@article{CMJ_2010_60_3_a7,
author = {Guo, Ji-Ming and Feng, Lin and Zhang, Jiong-Ming},
title = {On the multiplicity of {Laplacian} eigenvalues of graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {689--698},
year = {2010},
volume = {60},
number = {3},
mrnumber = {2672410},
zbl = {1224.05297},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2010_60_3_a7/}
}
Guo, Ji-Ming; Feng, Lin; Zhang, Jiong-Ming. On the multiplicity of Laplacian eigenvalues of graphs. Czechoslovak Mathematical Journal, Tome 60 (2010) no. 3, pp. 689-698. http://geodesic.mathdoc.fr/item/CMJ_2010_60_3_a7/