0
680views
Find all spanning trees for the graph G pictured below.
written 22 months ago by | • modified 22 months ago |
Find all spanning trees for the graph G pictured below.
ADD COMMENT
EDIT
1 Answer
written 22 months ago by | • modified 22 months ago |
Find all spanning trees for the graph G pictured below.
written 22 months ago by |
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)
(2)
(3)