Register

Min Cut set

599 views

1 Answer

0 votes
0 votes
MIN-cut =A mincut is then defined as a cut of graph G of minimum weight.

A) option ; you remove edge number 6 to get disconnected graph
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
Vikas123 asked Jan 9, 2019
1,323 views
CUT VERTEX
plz solve this problem..
plz solve this problem..
User Avatar
0 votes
0 votes
0 answers
3
Na462 asked Jan 19, 2019
601 views
Ace Test Series: Graph Theory - Cut Edges
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
User Avatar
2 votes
2 votes
1 answer
4
Akriti sood asked Nov 28, 2016
3,037 views
Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
how is this statement correct..can some one give an example?? Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
how is this statement correct..can some one give an example??Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
User Avatar
Link Copied!