BRIDGES
BITS Pilani
Hyderabad Campus
Michael Alphonse
Topics to be covered
Bridges
BITS Pilani, Hyderabad Campus
Definition and example
An edge e = uv of a connected graph G is called a bridge if
G – e is disconnected.
An edge e = uv is a bridge of a disconnected graph G if e is
a bridge of some component of G.
Find out all the bridges in this disconnected graphs ?
Have you observed anything in connection with the cycles ?
BITS Pilani, Hyderabad Campus
𝑣
𝑢
BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
Q1. Prove that if uv is a bridge in a graph G, then there is a
unique u-v path in G.
Q2. Prove that every connected graph all of whose vertices
have even degrees contains no bridges.
Q3. Find all the bridges in the following graph :
BITS Pilani, Hyderabad Campus