info@avatto.com
+91-9920808017
0. Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false?
Every minimum spanning tree of G must contain Emin
If Emax is in minimum spanning tree, then its removal must disconnect G.
No minimum spanning tree contains Emax
G has a unique minimum spanning tree.
You must be logged in to post a 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
You must be logged in to post a comment.