If we take n triangles and assume that they have exactly one

If we take n triangles and assume that they have exactly one vertex in common, we obtain the windmill graph M_n. Figure 5.2.3 shows M7. How many spanning trees are in the graph M_n?

Solution

There will be n number of spanning trees.

Suppose, there is M₈ graph, there will be 8 number of spanning trees.