# Question: Given a graph G and a minimum spanning tree T

Given a graph G and a minimum spanning tree T, suppose that we decrease the weight of one of the edges in T. Show that T is still a minimum spanning tree for G. More formally, let T be a minimum spanning tree for G with edge weights given by weight function w. Choose one edge (x, y) ¬ T and a positive number k, and define the weight function w′ by

Show that T is a minimum spanning tree for G with edge weights given by w′.

Show that T is a minimum spanning tree for G with edge weights given by w′.

**View Solution:**## Answer to relevant Questions

Suppose that all edge weights in a graph are integers in the range from 1 to |V|. How fast can you make Kruskal’s algorithm run? What if the edge weights are integers in the range from 1 to W for some constant W?A household refrigerator has a freezer at TF and a cold space at TC from which energy is removed and rejected to the ambient at TA as shown in Fig. P10.5Fresh water can be produced from saltwater by evaporation and subsequent condensation. An example is shown in Fig. P10.12 where 150-kg/s saltwater, state 1, comes from the condenser in a large power plant, the water is ...Water as saturated liquid at 200 kPa goes through a constant pressure heat exchanger. The heat input is supplied from a reversible heat pump extracting heat from the surroundings at 17C. The water flow rate is 2 ...Calculate the availability of the system (aluminum plus gas) at the initial and final states, and also the process irreversibility. State 1: T1 = 200 oC, v1 = V1/ m = 0.05 / 1.1186 = 0.0447 State 2: v2 = v1 ...Post your question