What is n-connected graph?

A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater.

This means a graph G is said to be k-connected if there does not exist a set of k-1 vertices whose removal disconnects the graph