Its N-1 Vertex Connectivity means minimum Number of vertices needed to be removed to disconnect the graph or make it a trivial graph Trivial Graph means graph with only one node Edge Connectivity means minimum number of edges that must be removed to disconnect the graph In case of complete graph min degree of any node is n-1 so you need to remove at least n-1 edges
6960 Points
2424 Points
2358 Points
2136 Points
2004 Points
1980 Points
1750 Points
1744 Points
1718 Points
Gatecse
This might help..