2,280 views

1 Answer

1 votes
1 votes

B) {d, e} 

If we remove d-e edge then there is no way to reach e and the graph is disconnected.

An edge is a bridge iff removal of edge disconnects the graph 

or

An edge is a bridge iff removal of edge increases the number of connected components. This variation is used in disconnected graphs.

Related questions

1 votes
1 votes
1 answer
1
admin asked Mar 30, 2020
949 views
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph?$(a,b), (e,f)$$(a,b), (a,c)$$(c,d), (d,h)$$(a,b)$
0 votes
0 votes
4 answers
2
admin asked Mar 30, 2020
1,409 views
Consider the following graph $L$ and find the bridges,if any.No bridge$\{d,e\}$$\{c,d\}$$\{c,d\}$ and $\{c,f\}$
0 votes
0 votes
1 answer
3
Sahil Gupta asked Dec 16, 2014
481 views
Consider the following set : {1,2,3,.....n}. Now consider all possible subset. Two subset S1 and S2 are having edge between them only if their intersection has two common...