On the spectral radius of minimally 2-(edge)-connected graphs with given size

Zhenzhen Lou, Min Gao, Qiongxiang Huang

A graph is minimally $k$-connected ($k$-edge-connected) if it is $k$-connected ($k$-edge-connected) and deleting arbitrary chosen edge always leaves a graph which is not $k$-connec…