Question

results for this submission
entered
12
0
at least one of the answers above is not correct.
consider the graph given above.
(a) how many edges are in this graph?
(b) how many bridges are in this graph? 1

Explanation:

Step1: Count the edges

An edge is a line segment connecting two vertices. By carefully counting each line segment in the graph, we find there are 13 edges.

Step2: Identify bridges

A bridge is an edge whose removal increases the number of connected components of the graph. In the given graph, the edge \(PQ\) is a bridge. So there is 1 bridge.

Answer:

(a) 13
(b) 1