Question about k-Connected Graphs
<p>Given an undirected Graph, G, is there any standard algorithm to find the value of k, where (k-1) represents the number of vertices whose removal results in a graph that is still connected and the removal of the kth vertex makes the graph disconnected? </p>

<p>Thank you!
Hop</p>
