离散数学100课件.pptVIP

Theorem: Let G be a graph with n nodes and e edges 1.G is a tree (connected, acyclic) 2. G is acyclic and e = n - 1 3.G is connected and e = n - 1 4.G is acyclic and if any two non-adjacent points are joined by an edge, the resulting graph has exactly one cycle 5. G is connected, but if any edge is deleted, it will be non-connected 6. Every two nodes of G are joined by a unique path Theorem: there exists at least two nodes of degree one for every tree. In many applications of trees, a particular vertex of a tree is designated as the root. Once we specify a root, we can assign a direction to each edge as follows: direct each edge away from the root. Thus, a tree together with its root produces a directed graph called a rooted tree. Properties of Trees Properties of Trees Properties of Trees Properties of Trees Example Computer File Systems A file system may be represented by a rooted tree. Spanning Trees This problem was solved with a connected subgraph with the minimum number of edges containing all vertices of the original simple graph. Such a graph must be a tree. Definition 1:Let G be a simple graph. A spanning tree of G is a subgraph of G that is a tree containing every vertex of G. Example Find a spanning tree of the simple graphG shown as follows. Now suppose that G is connected. If G is not a tree, it must contain a simple circuit. Remove an edge from one of these simple circuits. The resulting subgraph has one fewer edge but still contains all the vertices of G and is connected. If this subgraph is not a tree, it has a simple circuit; so as before, remove an edge that is in a simple circuit. Repeat this process until no simple circuits remain. This is possible becausenthere are only a finite number of edges in the graph. The process terminates when no simple circuits remain. A tree is produced since the graph stays connected as edges are removed. This tree is a spanning tree since it contains every vertex of G. Example IP Multicasting（多点传送） ,With