More on Graph Perturbations
Peter Rowlinson · Bulletin of the London Mathematical Society · 1990
Various modifications of a connected graph G are regarded as perturbations of an adjacency matrix A of G. Several results concerning the resulting changes to the largest eigenvalue of A are obtained by solving intermediate eigenvalue problems of the second type.