Find all spanning trees for the graph G pictured below.

1.3kviews

written 3.5 years ago by

prajapatijaimin • 3.3k

• modified 3.5 years ago

Find all spanning trees for the graph G pictured below.

enter image description here

discrete structures and graph theory

ADD COMMENT EDIT

1 Answer

55views

written 3.5 years ago by

prajapatijaimin • 3.3k

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

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.