![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
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 |
Answer» D. removing one edge from the spanning tree will not make the graph disconnected | |
Explanation: every spanning tree has n – 1 edges if the graph has n edges and has no cycles. the mst follows the cut property, 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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet