What is the minimum number of cuts that a graph with 'n' vertices can – McqOptions

MCQOPTIONS

1.	What is the minimum number of cuts that a graph with 'n' vertices can have?
A.	n+1
B.	n(n-1)
C.	n(n+1)/2
D.	n(n-1)/2
Answer» D. n(n-1)/2

Discussion

No Comment Found

Related MCQs

Minimum cut algorithm comes along with the maximum flow problem.
What is the running time of Karger's algorithm to find the minimum cut in a graph?
_____________ is a family of combinatorial optimization problems in which a graph is partitioned into two or more parts with constraints.
What is the minimum number of cuts that a graph with 'n' vertices can have?
In how many ways can a Gomory-Hu tree be implemented?
Which algorithm is used to solve a minimum cut algorithm?
The weight of the cut is not equal to the maximum flow in a network.
Which one of the following is not an application of max-flow min-cut algorithm?
What is the running time of implementing a min-cut algorithm using bidirected edges in a graph?
___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.