info@avatto.com
+91-9920808017
0. Let G be a graph with vertices. Let the mincut in G be of size. Which of the following statements are true?
There is a vertex in G with degree 10.
G does have any cycles
G has at least 50 edges
Every vertex in G has degree at least 5.
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
