Extremal spectral radius and $g$-good $r$-component connectivity

Wenxiu Ding, Dan Li, Yu Wang

For $F\subseteq V(G)$, if $G-F$ is a disconnected graph with at least $r$ components and each vertex $v\in V(G)\backslash F$ has at least $g$ neighbors, then $F$ is called a $g$-go…