Find a spanning trees for each of the graphs in 3 and 4.
3.
To find:
A spanning tree for the given graph.
Given information:
The given graph is shown below:
Definition Used:
Spanning Tree:
A spanning tree for a graph G is a sub-graph of G that contains every vertex of G and is a tree. A spanning tree does not have cycles and it cannot be disconnected graph.
The given graph G has four circuits