-2
$\begingroup$

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

$\endgroup$

closed as unclear what you're asking by Yuval Filmus, Evil, Juho, Discrete lizard, David Richerby May 11 '18 at 11:50

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • 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.