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
Gatecse
Visit exam center at your own risk ...