Q57
Which of the following is false?
A.
The spanning trees do not have any cycles
B.
MST have n - 1 edges if the graph has n edges
C.
Edge e belonging to a cut of the graph if has the weight smaller than any other edge in the same cut, then the edge e is present in all the MSTs of the graph
D.
Removing one edge from the spanning tree will not make the graph disconnected
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board