JAVA
October 13, 2023Aptitude
October 13, 2023Nielit ScientistB IT 22072017
Question 6

Considering the following graph, which one of the following set of edged represents all the bridges of the given graph?
(a,b)(e,f)


(a,b),(a,c)


(c,d)(d,h)


(a,b)

Question 6 Explanation:
● A bridge ,cutedge, 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.
● The removal of edges (a,b) and (e,f) makes graph disconnected.
● Equivalently, an edge is a bridge if and only if it is not contained in any cycle.
● The removal of edges (a,b) and (e,f) makes graph disconnected.
Correct Answer: A
Question 6 Explanation:
● A bridge ,cutedge, 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.
● The removal of edges (a,b) and (e,f) makes graph disconnected.
● Equivalently, an edge is a bridge if and only if it is not contained in any cycle.
● The removal of edges (a,b) and (e,f) makes graph disconnected.
Subscribe
Login
0 Comments