Graph theorysome details about null graph
Questions

1
Doubt about example shown in video
Sir you said that vertex connectivity should be n1 for a complete graph so then it degrades down to a single vertex which is still connected right ?
So here also you cant disconnect complete graph 
1
doubt
So,In case of complete graph which is an exception we will end up in single vertex always and we should consider single vertex as a disconnect graph?

1
doubt

A graph G is said to be kconnected (or kvertex connected, or kpoint connected) if there does not exist a set of k1 vertices whose removal disconnects the graph, i.e., the vertex connectivity of G is >=k
In such graph there doesn’t exist a set of vertices of k2 vertices whose removal disconnects the graph. So obviously it is k1 connected too.
