Abstract
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.
Similar content being viewed by others
References
D.M. Cvetković, M. Doob and H. Sachs: Spectra of Graphs-Theory and Application. Deutscher Verlag der Wissenschaften — Academic Press, Berlin-New York, 1980; second edition 1982; third edition, Johann Ambrosius Barth Verlag, Heidelberg-Leipzig, 1995.
I. Faria: Permanental roots and the star degree of a graph. Linear Algebra Appl. 64 (1985), 255–265.
R. Grone, R. Merris and V. S. Sunder: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11 (1990), 218–238.
R. Grone and R. Merris: The Laplacian spectrum of a graph II*. SIAM J. Discrete Math. 7 (1994), 221–229.
J.M. Guo: On the second largest Laplacian eigenvalue of trees. Linear Alg. Appl. 404 (2005), 251–261.
B. Mohar: The Laplacian spectrum of graphs. Graph Theory, Combinatorics, and Applications 2 (1991), 871–898.
J.Y. Shao, J.M. Guo and H.Y. Shan: The ordering of trees and connected graphs by algebraic connectivity. Linear Alg. Appl. 428 (2008), 1421–1438.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Science Foundation of China (No. 10871204) and the Research and Innovation Projects of China University of Petroleum (No. 09CX04003A).
Rights and permissions
About this article
Cite this article
Guo, JM., Feng, L. & Zhang, JM. On the multiplicity of laplacian eigenvalues of graphs. Czech Math J 60, 689–698 (2010). https://doi.org/10.1007/s10587-010-0063-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-010-0063-x