In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true? , In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

Solution

B. A bridge cannot be part of a simple cycle

Explanation

A bridge in a graph cannot be a part of cycle as removing it will not create a disconnected graph if there is a cycle. A graph G is connected if there is a path in G between any given pair of vertices, otherwise it is disconnected. Every disconnected graph can be split up into a number of connected sub graphs, called components. Sub graph. Let G be a graph with vertex set V(G) and edge-list E(G).