Explain the concept of spanning tree in district Mathematics..
Answers
Answered by
0
Answer:
A spanning tree is a connected graph using all vertices in which there are no circuits. In other words, there is a path from any vertex to any other vertex, but no circuits.
HOPE IT HELP YOU ...
Answered by
0
Answer:
Advertisements. A spanning tree of a connected undirected graph G is a tree that minimally includes all of the vertices of G. A graph may have many spanning trees.
Similar questions