Consider the spanning trees T1 and T2 in the proof of
Chapter 10, Problem 23E(choose chapter or problem)
Consider the spanning trees T1 and T2 in the proof of Theorem 10.7.3. Prove that w(T2) ? w(T1).Reference:Correctness of Prim’s AlgorithmWhen a connected, weighted graph G is input to Prim’s algorithm, the output is a minimum spanning tree for G.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer