Question 7811 – Computer-Networks
November 19, 2023Question 10311 – Algorithms
November 19, 2023Question 11088 – Algorithms
Let G be a weighted undirected graph and e be an edge with maximum weight in G. Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the following statements is always TRUE?
Correct Answer: A
Question 50 Explanation:
(A) True, because if there is heaviest edge in MST, then there exist a cut with all edges with weight equal to heaviest edge.
(B) False, because the cutset of heaviest edge may contain only one edge.
(C) False. The cutset may form cycle with other edge.
(D) False. Not always true.
(B) False, because the cutset of heaviest edge may contain only one edge.
(C) False. The cutset may form cycle with other edge.
(D) False. Not always true.
There exists a cutset in G having all edges of maximum weight
There exists a cycle in G having all edges of maximum weight
Edge e cannot be contained in a cycle
All edges in G have the same weight
Subscribe
Login
0 Comments