Rank one perturbation and its application to the laplacian spectrum of a graph

Characterization of rank one perturbations of symmetric matrices which change only one eigenvalue are given. Then the result is applied to study how the Laplacian spectrum of a graph changes when adding an edge.

[1]  R. Merris.  Degree maximal graphs are Laplacian integral , 1994 .

[2]  Frank Harary,et al.  Which graphs have integral spectra , 1974 .

[3]  Robert Grone,et al.  On the geometry and Laplacian of a graph , 1991 .

[4]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  V. Sunder,et al.  The Laplacian spectrum of a graph , 1990 .

[7]  Russell Merris,et al.  The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..