Find a spanning trees for each of the graphs in 3 and 4.

4.

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.

m−(n−1) edges must be remove from a connected graph with n vertices and m edges to produce a spanning tree.

The given graph G has four circuits rztxyr,syxs,xuvx  and  xvwx  and removal of any edges of the circuit gives a tree