Gate CS-2019 Question Paper With Solutions

Q. 47 Let G be any connection, weighted, undirected graph:

  • I. G has a unique minimum spanning tree if no two edges of G have the same weight.
  • II. G has a unique minimum spanning tree if, for every cut G, there is a unique minimum weight edge crossing the cut.

Which of the above two statements is/are TRUE?

(A) Neither I nor II

(B) I only

(C) II only

(D) Both I and II

Answer: (D)

Explanation:

Learn More:   Gate ME-2009 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here