Find all spanning trees for the graph G pictured below.

947views

written 2.5 years ago by

prajapatijaimin • 3.2k

• modified 2.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

43views

written 2.5 years ago by

prajapatijaimin • 3.2k

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

ADD COMMENT EDIT

Please log in to add an answer.