1,165 views
2 votes
2 votes
Let G be a 3-regular graph and S be a minimum vertex cut of G with |S| = 5
The the size of smallest edge cut of G is _______
(A)4
(B) 5
(C) 6
(D) None of the above

Please log in or register to answer this question.

Related questions

9 votes
9 votes
2 answers
1
3 votes
3 votes
3 answers
2
rahul sharma 5 asked Jun 12, 2017
1,911 views
What are the chromatic number of following graphs?Answer is 6 and 4 respectively.But i am getting 3 for both.Please someone confirm this?
3 votes
3 votes
1 answer
3
rahul sharma 5 asked Jun 7, 2017
1,254 views
What is the vertex connectivity and edge connectivity of complete graph?Is it n or n-1?
2 votes
2 votes
2 answers
4
rahul sharma 5 asked Jun 12, 2017
1,982 views
What are the necessary and sufficient conditions for Euler path and Circuit in directed graph?