Find all possible spanning trees for each of the graphs in 1 and 2.

1.

To find:

All the possible spanning trees 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 one circuit dabd and removal of any edges of the circuit gives a tree.

The complete graph can have maximum nn−2 number of spanning trees.

The complete graph dabd is as shown below: