1. Let G=(V, E) be a connected, undirected graph with weight function w. Let u be...

Transcribed Image Text:

1. Let G=(V, E) be a connected, undirected graph with weight function w. Let u be a vertex of G, and let e = (u, v) be an edge incident to u, having minimum weight among the edges incident to u. Prove or disprove the following statements. a.) Edge e is contained in some minimum spanning tree. b.) Edge e is contained in every minimum spanning tree. 1. Let G=(V, E) be a connected, undirected graph with weight function w. Let u be a vertex of G, and let e = (u, v) be an edge incident to u, having minimum weight among the edges incident to u. Prove or disprove the following statements. a.) Edge e is contained in some minimum spanning tree. b.) Edge e is contained in every minimum spanning tree.

Answer rating: 100% (QA)

a Prove Edge e is contained in some minimum spanning tree Proof Let T be a minimum spanning tree of ... View the full answer