Graph reduction techniques and the multiplicity of the Laplacian eigenvalues

Abstract

Let $M=[m_{ij}]$ be an $n\times m$ real matrix, $\rho$ be a nonzero real number, and $A$ be a symmetric real matrix. We denote by $D(M)$ the $n\times n$ diagonal matrix $diag({\sum }_{j=1}^m{m}_{1j},\dots ,{\sum }_{j=1}^m{m}_{nj})$ and denote by $L_A^{\rho }$ the generalized Laplacian matrix $D(A)-\rho A$. A well-known result of Grone et al. states that by connecting one of the end-vertices of $P_3$ to an arbitrary vertex of a graph, does not change the multiplicity of Laplacian eigenvalue $1$. We extend this theorem and some other results for a given generalized Laplacian eigenvalue $\mu$. Furthermore, we give two proofs for a conjecture by Saito and Woei on the relation between the multiplicity of some Laplacian eigenvalues and pendant paths.

arXiv comment13 pages, 9 figures, two corrected typos in Lemma 20, to appear in Linear Algebra and its Applications

Cited by in corpus (1)

• Structure of Trees with Respect to Nodal Vertex Sets