-2
$\begingroup$

If a graph has a unique MST, then its edge weights are distinct. True or false ? Justify your answer.

$\endgroup$
  • 3
    $\begingroup$ You should first make some effort solving the exercise on your own. $\endgroup$ – Yuval Filmus May 10 '18 at 22:01
5
$\begingroup$

The answer is: not necessarily.

Counterexample: consider a graph that is a tree with all of its edges the same weight. Then the only MST is the entire graph and none of the edge weights are distinct.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.