Search

1 of 8 0-day streak

Connected graphs and bridges

Question 1 of 8

No calculator

Consider the following undirected graph

Graph. Vertices in listed order: [F | C | G | B | H]. Full edge list: C–B; G–C; H–C; H–BFCGBH
1 mark

Is this graph connected? Select the option with the correct reason