0
680views
Find all spanning trees for the graph G pictured below.

Find all spanning trees for the graph G pictured below.

enter image description here

1 Answer
1
35views

Solution:

Graph G has one circuit v2v1v4v2, and the removal of any edge of the circuit gives a tree. Thus, as shown below, there are three spanning trees for G.

(1) enter image description here

(2) enter image description here

(3) enter image description here

Please log in to add an answer.