Definition:Bridge
From ProofWiki
Definition
Let $G = \left({V, E}\right)$ be a connected graph.
Let $e \in E$ be an edge of $G$ such that $G - e$ is disconnected.
Then $v$ is known as a bridge of $G$.
In this context, $G - e$ signifies the graph $G$ with the edge $e$ removed.
Example
In the graph below, $CD$ is a bridge.
The graph would be separated into the two components $ABC$ and $DEF$.
Sources
- Gary Chartrand: Introductory Graph Theory (1977): $\S 2.4$
