What is the minimum spanning tree of an undirected graph g?

The minimum spanning tree of an undirected graph g is the smallest tree that connects all the vertices in the graph without forming any cycles. It is a subgraph of the original graph that includes all the vertices and has the minimum possible total edge weight.