Minimum Cut on Data Structure and Algorithms related Questions and Answers


Question :   What is the minimum number of cuts that a graph with 'n' vertices can have?
1. n+1
2. n(n-1)
3. n(n+1)/2
4. n(n-1)/2
Answer :   3 - n(n+1)/2  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter