Question: Consider an edge - weighted graph G in which edge weights are all distinct from each other. Let T be a MST of G .

Consider an edge-weighted graph G in which edge weights are all distinct from each
other. Let T be a MST of G. Suppose the weight of one edge e0 in E(G) is changed fromw(e0) to w0(e0) in which w0
(e0) is a unique weight different from w(e) for any e in E(G). The weights of other edges in E(G) remain same. So a new graph G0 and a new weight function w0 are defined such that (i) V (G0)= V (G),
(ii) E(G0)= E(G),(iii) w0
(e)= w(e) for each e 6= e0 in E(G), and (iv) w0(e0)6= w(e) for any e in E(G).
We are interested in deciding whether e0 in T0 where T0 is a MST of G0. Answer true or false
in each of the following cases. You do not need to prove your answer.
(a) e0 is always in T0 when e0 in T and w0(e0)< w(e0)
(b) e0 is always in T0 when e0 in T and w0(e0)> w(e0)
(c) e0 is always in T0 when e0 in / T and w0(e0)< w(e0)
(d) e0 is always in T0 when e0 in / T and w0(e0)> w(e0)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!