bridge

A bridge of a graph $G$ is an edge whose deletion increases the number of components of $G$. The vertex analogue of a bridge is a cutvertex.