We investigate the parameterized complexity in $a$ and $b$ of determining whether a graph~$G$ has a subset of $a$ vertices and $b$ edges whose removal disconnects $G$, or disconnects two prescribed vertices $s, t \in V(G)$.

翻译：我们用a美元和b美元来调查参数复杂程度,以确定图~G美元是否有一个子项为1美元顶点和1美元边缘,其去除断开部分为1美元顶点和1美元边缘,或切断两个规定的顶点,t v(G)美元。