in Graph Theory edited by
943 views
1 vote
1 vote

Considering the following graph, which one of the following set of edges represents all the bridges of the given graph?

  1. $(a,b), (e,f)$
  2. $(a,b), (a,c)$
  3. $(c,d), (d,h)$
  4. $(a,b)$
in Graph Theory edited by
by
943 views

1 Answer

3 votes
3 votes
Best answer
  • A bridge ,cut-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. 
  • The removal of edges (a,b) and (e,f) makes graph disconnected.

 

option A

selected by

1 comment

cut vertices for above graph= $a,e,d$

cut edges= $(a,b),(e,f)$
0
0
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true