Lecture7-Minimum Spanning Tree-Extension.pptVIP

Lecture 7-Minimum Spanning Tree--Extension Properties of MST Property 1: Let (u, v) be a minimum-weight edge in a graph G = (V, E), then (u, v) belongs to some minimum spanning tree of G. Proof: Let A be the empty set of edges. Then A is a subset of some minimum spanning tree, and A does not include (u, v). Then cut (u, V\u) respects A. Edge (u, v) is a light edge crossing cut (u, V\u). According to theorem 23.1, (u, v) is a safe edge for A. Hence, (u, v) belongs to some minimum spanning tree. Another method: Suppose T is an arbitrary MST, and (u, v) is not in T. Then T + (u, v) contains