How many edges does a minimum spanning tree of a graph with V vertices have?

Answer

V − 1

A spanning tree is connected and acyclic on all V vertices, and any tree on V vertices has exactly V−1 edges (Theorem B.2). One fewer would disconnect it; one more would create a cycle.