An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs

We obtain an explicit formula for the absolute difference between two eigenvector components for a weighted graph’s Laplacian matrix, in terms of the Laplacian’s eigenvalues as well as the eigenvalues of matrices associated with certain coalesced graphs. We then briefly illustrate two uses of this formula, in analyzing graph modifications.