Perturbations on bidegreed graphs minimizing the spectral radius

One common problem in spectral graph theory is to determine which graphs, under some prescribed constraints, maximize or minimize the spectral radius of the adjacency matrix. Here we consider minimizers in the set of bidegreed, or biregular, graphs with pendant vertices and given degree sequence. In this setting, we consider a particular graph perturbation whose effect is to decrease the spectral radius. Hence we restrict the structure of minimizers for k-cyclic degree sequences