A connected graph $G$ has $n$ vertices. If we remove a vertex and its incident edges, the graph is left with exactly $k$ connected components. If this holds for all vertices, what is the specific graph property associated with the minimum value of $k$ over all possible choices of vertex removal?