A

Admin • 832.70K Points
Coach

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

Explanation by: Admin

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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.