Answer:
A spanning tree is a subgroup of Graph G, covering all vertices with a lowest number of possible edges
Step-by-step explanation:
A spanning tree is a subgroup of Graph G, covering all vertices with a lowest number of possible edges. Therefore, a spanning tree has no patterns and can not be separated. we can concluded this also every graph G is more or less has one spanning tree.The spanning tree's cost is the total amount of all the edges in the tree's weights. There can be a numerous number of trees spanning. Minimum spanning tree is the type of spanning tree where the value of all spanning trees is minimal.