minimal spanning tree

Question

Consider the following graph:

The maximum possible weight that a minimum weight spanning tree of G can have is

is the answer 25

Comments

It will be 21 .

---

it will be 21 since weight of minimum spaning tree is uniue.

---

@Amit,

suppose the edges were not defined, and question says , that all edge weights are unique .

Then , it is upon us to make different possible combinations, of graphs .

Then maximal weight of MST exists .

Here, it is only one combination , so unique MST.

Answer 1

answer should be 21

@kapil

if all edges are not unique i.e we have more than two edges wth same weight then in that case we may or may not get unique spanning tree.

But if all the edges are of same weight then we can have more than one spanning tree.(not unique) ryt??

one more thing we include maximal weight edge in minimum spanning tree only if there is chance of disconnection while deriving MST...

Comments

Yes, right !!