Question 9762 – Database-Management-System
February 13, 2024
Question 10740 – Minimum-Spanning-Tree
February 13, 2024
Question 9762 – Database-Management-System
February 13, 2024
Question 10740 – Minimum-Spanning-Tree
February 13, 2024

Question 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:
A
Every minimum spanning tree of G must contain emin
B
If emax is in a minimum spanning tree, then its removal must disconnect G
C
No minimum spanning tree contains emax
D
G has a unique minimum spanning tree
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!