A minimum spanning tree is a special kind of tree that minimizes the lengths (or “weights”) of the edges of the tree.
A complete graph having n edges may have how many numbers of spanning tress?
Spanning tree doesn’t have any cycles
Algorithms for constructing Spanning tree algorithms
By using minimum spanning tree we can solve the travelling salesman problem?
There will be more than one spanning tree for the given graph
Every graph is a minimum spanning tree
Minimum spanning tree is a spanning tree with the lowest cost among all the spacing trees.
Spanning trees are always cyclic
Prim’s algorithm also called as