Find a diffrent minimal spanning tree for a graph

Question

For my homework I have a problem that I can't solve and it makes me wonder about 2 different MST:

Let $G=(V,E)$ be a graph that has a minimum spanning tree $T$.

I want to find another minimum spanning tree $T'$ that has at least 1 different edge $e'$ such that the weight of $e'$ is differ from any weight of edges in $T$.

If $T'$ doesn't exist I can claim that every 2 different MST must have the same weight for each edge.

My intuition says that this claim is wrong but on the other hand I can't find example of $T'$ to contradict this claim.

What exactly is your claim? If $T'$ does not exist, then $T$ is unique, sure. But $T'$ can exist, under certain conditions. They are all similar, though. — Raphael, Dec 16 '13 at 20:09

score 1 · Accepted Answer · edited Apr 13 '17 at 12:48

1

You cannot find such a MST. Every two minimal spanning trees must have the same multiset of edge-weights. Actually you can find the proof in the link that Raphael added:

Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?

edited Apr 13 '17 at 12:48

Community

1

answered Dec 19 '13 at 10:43

Gari BN

356
1
6

Find a diffrent minimal spanning tree for a graph

1 Answers1