A

Admin • 833K Points
Coach

Q. Every graph has only one minimum spanning tree.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

Explanation by: Admin

minimum spanning tree is a spanning tree with the lowest cost among all the spacing trees. sum of all of the edges in the spanning tree is the cost of the spanning tree. there can be many minimum spanning trees for a given graph.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.