Question: Show that a graph has a unique minimum spanning tree
Show that a graph has a unique minimum spanning tree if, for every cut of the graph, there is a unique light edge crossing the cut. Show that the converse is not true by giving a counterexample.
Answer to relevant QuestionsGiven 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 ...Calculate the reversible work out of the two-stage turbine shown in Problem 6.41, assuming the ambient is at 25C. Compare this to the actual work which was found to be 18.08 MW.A 2-kg/s flow of steam at 1 MPa, 700C should be brought to 500C by spraying in liquid water at 1 MPa, 20C in an SSSF setup. Find the rate of irreversibility, assuming that surroundings are at ...A counter flowing heat exchanger cools air at 600 K, 400 kPa to 320 K using a supply of water at 20C, 200 kPa. The water flow rate is 0.1 kg/s and the air flow rate is 1 kg/s. Assume this can be done in a reversible ...A 1 kg block of copper at 350C is quenched in a 10 kg oil bath initially at ambient temperature of 20C. Calculate the final uniform temperature (no heat transfer to/from ambient) and the change of ...
Post your question