Skip to content

Latest commit

 

History

History
26 lines (16 loc) · 1.15 KB

File metadata and controls

26 lines (16 loc) · 1.15 KB

Bridges in Graph

In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases its number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. A graph is said to be bridgeless or isthmus-free if it contains no bridges.

Bridges in graph

A graph with 16 vertices and 6 bridges (highlighted in red)

Bridgeless

An undirected connected graph with no cut edges

Bridges in graph

Bridges in graph

Bridges in graph

References