6.4.18 Graph theory

Problem: Find three non-isomorphic spanning trees of the graph. In the case of a disconnected graph, spanning trees must be found for the larger component.