636 views
0 votes
0 votes
The cardinality of the vertex-cut ( seperating set ) of a complete graph with n vertices is ___

1 Answer

Best answer
6 votes
6 votes

Vertex-cut ( separating set ) This is a set of vertex, which if you remove from the graph, the graph will be disconnected. 

There is no, cut-vertex possible in the complete graph. Since every vertex is connected to every other vertices, hence its impossible to make it disconnected by removing any number of vertices. 

selected by

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
Pavan Kumar Munnam asked May 12, 2017
376 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
3 votes
3 votes
3 answers
3
Vicky rix asked Apr 7, 2017
1,406 views
A graph consists of only one vertex,which is isolated ..Is that graphA) a complete graph ???B) a clique???C) connected graph ???Please explain your answer ...
0 votes
0 votes
1 answer
4