离散数学课件----Trees.ppt

* * * * * * * * * * * * * Number of Vertices and Edges A tree with n vertices has n-1 edges Proof: There are at least n-1 edges to connect n vertices. Suppose that there are more than n-1 edges. So, the sum of in-degree of all vertices must be more than n-1. However, the in-degree of the root is zero, and in-degree of any of the other n-1 vertices is 1, which mean the sum is n-1. Contradiction. Spanning Tree If R is a symmetric, connected relation on A, a tree T on A is a spanning tree of R if T is a tree with exactly the same vertices as R. An undirected spanning tree is the symmetric closure of a spanning tree. Note that an undirected spanning tree can always obtained by remove some edges from a symmetric, connected relation R. Spanning Tree: Examples Different spanning tree are obtained from a symmetric, connected relation: Breaking cycles Breadth first Depth first 1 2 3 4 5 6 7 8 9 10 11 12 Merging Two Vertices v0 v6 v2 v5 v4 v1 v3 v6 v2 v5 v4 v3 v0’ v6 v5 v4 v3 v0” Matrix Operation for Merging v0 v1 v2 v3 v4 v5 v6 v0 v1 v2 v3 v4 v5 v6 Merging v0 and v1 v0” v3 v4 v5 v6 v0” v3 v4 v5 v6 v0’ v2 v3 v4 v5 v6 v0’ v2 v3 v4 v5 v6 Merging v0’ and v2 Constructing a Spanning Tree a b c d a a a b b b c c c d d d 0. Let a be the starting vertex, selecting edges one by one in original R 1. Merging a and c into a’({a,c}), selecting (a,c) 2. Merging a’ and b into a”({a,c,b}), selecting (c,b) 3. Merging a” and d into a”’({a,c,b,d}), selecting (a,d) or (d,b) Ending, as only one vertex left (0) (1) (2) (3) Weighted Graph and MST A weighted graph 27 26 42 21 21 53 25 33 28 36 18 17 34 29 22 A I H J E C B G F D 16 21 25 The nearest neighbor of vertex I is H The nearest neighbor of shaded subset of vertex is G Weighted Graph and MST 27 26 42 21 21 53 25 33 28 36 18 17 34 29 22 A I H J E C B G F D 16 27 26 42 21 21 53 25 33 28 36 18 17 34 29 22 A I H J E C B G F D 16 27 26 42 21 21 53 25 33 28 36 18 17 34 29 22 A