What is the minimum number of cuts that a graph with ‘n’ vertices

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.

Discussion