Find all spanning trees for the graph Select all that apply

Find all spanning trees for the graph. Select all that apply.

Solution

Options - A, C, E and F.

A spanning tree of an undirected graph(like this) is a subgraph that is a tree which includes all of the vertices of the graph.

In option B, tree does not include node A. So, it can not be a spanning tree for the given graph.

Option D, ABCD forms a cycle, therefore this is not a tree at all. Also, it is disconnected from GEF. For a tree all Nodes should be connected.

The options A, C, E and F satisfies the condition. They are all valid trees. And they include all nodes of the graph. Therefore they are spanning trees for the given graph.