The graph in Figure 3.5 has vertices \(a, b, c, d, e\) and edges \( (a, d), (a, e), (b, e), (b, c), (d, e), (e, c) \).
Step 2:
Understand the definition of a spanning tree. A spanning tree of a graph is a subgraph that includes all the vertices of the original
Show more…
