Database-Management-System
February 13, 2024Question 10740 – Minimum-Spanning-Tree
February 13, 2024GATE 2000
| Question 41 |
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 a minimum spanning tree, then its removal must disconnect G | |
| No minimum spanning tree contains emax | |
| G has a unique minimum spanning tree |
Question 41 Explanation:
Minimum Spanning Tree:
Correct Answer: C
Question 41 Explanation:
Minimum Spanning Tree:
Subscribe
Login
0 Comments