Question

consider the graph given above.
(a) how many edges are in this graph?
(b) how many bridges are in this graph?

Explanation:

Step1: Count the edges

Edges are the lines connecting the vertices. By carefully counting each line segment in the graph:

• \(PQ\), \(PR\), \(PO\), \(RN\), \(RT\), \(RU\), \(ST\), \(SN\), \(UT\), \(UN\), \(OT\), \(PN\)

There are \(12\) edges.

Step2: Identify bridges

A bridge is an edge whose removal increases the number of connected components. In this graph, there are no such edges. If we remove any edge, the graph remains connected.

Answer:

(a) \(12\)
(b) \(0\)