closed by
584 views

1 Answer

3 votes
3 votes

I think

1) Vertex connectivity = 2     Example: {v3,v4} is a vertex-set 

2) Edge connectivity = 2 (Since the minimum degree of a vertex is 2, edge-connectity <= 2. Here edge-connectivity of 1 is not possible)

3) It is not a seperable graph because vertex connectivity is not 1.

4) {v1,v2,v5} is not a vertex-set because on removal of them,still the graph remains connected .

Related questions

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