Q920
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
AnswerD.
n(n-1)/2
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board