An graph edge of a graph is separating if a path from a point to a point
must pass over it. Separating graph
edges can therefore be viewed as either bridges or dead ends.
See also
Explore with Wolfram|Alpha
![]()
More things to try:
Cite this as:
Weisstein, Eric W. "Separating Edge." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SeparatingEdge.html