Augmenting the Algebraic Connectivity of Graphs

Bogdan-Adrian Manghiuc, Pan Peng, He Sun

For any undirected graph $G=(V,E)$ and a set $E_W$ of candidate edges with $E\cap E_W=\varnothing$, the $(k,\gamma )$-spectral augmentability problem is to find a set $F$ of $k$ edges from…