For any tree with vertices V and edges E, |V| = |E| + 1Any connected undirected graph has a spanning treeAny undirected connected graph with the property |V| = |E| + 1 is a treeCut propertyMinimum spanning tree is unique for a graph that has all the edges whose costs are different from one another