A spanning tree of a graph with \( n \) vertices always has exactly \( n \) vertices. This is because a spanning tree is a subgraph that includes all the vertices of the original graph but without cycles and with the minimal number of edges.
Thus, the number of vertices in the spanning tree is \( n \).