Finding the number of spanning trees in a graph

MathematicsComputer EngineeringMCA

Problem Statement

Find the number of spanning trees in the following graph.

Spanning Trees Example


The number of spanning trees obtained from the above graph is 3. They are as follows −

Obtained Spanning Trees

These three are the spanning trees for the given graphs. Here the graphs I and II are isomorphic to each other. Clearly, the number of non-isomorphic spanning trees is two.

Updated on 23-Aug-2019 07:32:20