Question 9762 – Database-Management-System
February 13, 2024Question 10740 – Minimum-Spanning-Tree
February 13, 2024Question 9849 – Minimum-Spanning-Tree
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?
Correct Answer: C
Question 6 Explanation:
Minimum Spanning Tree:
Every minimum spanning tree of G must contain emin
If emax is in a minimum spanning tree, then its removal must disconnect G
No minimum spanning tree contains emax
G has a unique minimum spanning tree
Subscribe
Login
0 Comments