Minimum Spanning Tree

Let H = (V,T) be a subgraph of an undirected graph G = (V,E). H is a Minimum Spanning tree of G if H is both acyclic and connected and removal of edge disconnects it and the sum of the edge costs is minimized. Wikipedia Definition of Minimum Spanning Tree Here.

Minimum Spanning Tree
Properties of Spanning Tree
Let H = (V , T) be a subgraph of an undirected Graph G = (V, E). Then Following Properties holds:

H is spanning tree of G. It is acyclic and connects. It has v-1 edges.
If edge removal disconnects the graph, Graph is minimally connect graph.
If edge adds and creates the cycle, graph is maximally acyclic.
To Read More Visit https://hecodesit.com/minimum-spanning-tree/