Computer Sciences > GATE 2015 SET-2 > Graph Theory
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
Correct : b
Similar Questions
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (...
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (...
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (...
Total Unique Visitors
Loading......