1,727 views

2 Answers

Best answer
10 votes
10 votes

Vertex Connectivity: The minimum number of nodes of a graph G, whose deletion from the graph G disconnects it. Vertex connectivity is sometimes called "point connectivity" or simply "connectivity."

In the above graph, if we delete $ \{ v4 \} $ or $ \{ v1, v5, v6 \} $ then graph will be disconnected. But we have to choose minimum number of vertex, hence we choose $ \{ v4 \} $.

Edge Connectivity: The minimum number of edges of a graph G, whose deletion from a graph G disconnects G, also called the line connectivity.

In the above graph, if we delete $ \{ k \} $, or $ \{ a, c, h \} $ or $ \{ a, c, d, f \} $ then graph will be disconnected. But we have to choose minimum number of edges, hence we choose $ \{ k \} $. 

Separable Graph: A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be biconnected (or nonseparable).

Yes, The above graph is a separable graph, because we can make it disconnected by deleting $ \{ v4 \} $. Hence $ \{ v4 \} $ is a cut-vertex or Articulation point. 

selected by
0 votes
0 votes
Vertex-connetivity = 1 (v4 is the cut-vertex)
Edge connectivity = 1 (k is the cut-edge)
since vertex connectivity =1 , it is a seperable-graph.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
Pavan Kumar Munnam asked May 12, 2017
374 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,405 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