  We show how the spectrum of a graph Laplacian changes with respect to a
certain type of rank-one perturbation. We apply our finding to give new short
proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known
derivations for the characteristic polynomials of the Laplacians for several
well known families of graphs, including complete, complete multipartite, and
threshold graphs.
