info@avatto.com
+91-9920808017
0. Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?
There is a minimum spanning tree containing e
If e is not in a minimum spanning tree T, then in the cycle formed by adding e to T, all edges have the same weight.
Every minimum spanning tree has an edge of weight w;
e is present in every minimum spanning tree
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
