edited by
1,409 views

4 Answers

1 votes
1 votes
Bridge (or Cut edge): an edge whose removal produces a graph with more connected component than in the original graph.

In the above given graph only {d,e} is a bridge since its removal produces 2 components.
1 votes
1 votes
An edge is bridge iff its removal disconnects the graph (or increases the number of disconnected components, if its already disconnected).

Bridge cannot be part of a cycle. So only candidate of bridge is de. (rest all part of cycle). Removal of de disconnects the graph so it is a bridge.

So B is correct.
0 votes
0 votes
A bridge, ut-edge, 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.
A graph is said to be bridgeless or isthmus-free if it contains no bridges.
If we remove {d,e} edge then there is no way to reach e and the graph is disconnected.
The removal of edges {c,d} and {c,f} makes graph disconnect but this forms a cycle.
Answer:

Related questions

1 votes
1 votes
1 answer
1
admin asked Mar 30, 2020
952 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
0 answers
2
admin asked Mar 30, 2020
1,166 views
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
0 votes
0 votes
3 answers
3
admin asked Mar 30, 2020
2,264 views
The following graph has no Euler circuit becauseIt has $7$ vertices.It is even-valent (all vertices have even valence).It is not connected.It does not have a Euler circui...
0 votes
0 votes
7 answers
4
admin asked Mar 30, 2020
2,088 views
For the graph shown, which of the following paths is a Hamilton circuit?$ABCDCFDEFAEA$$AEDCBAF$$AEFDCBA$$AFCDEBA$