太原理工大学离散数学课件 第6章 树.pdfVIP

太原理工大学 《离散数学》 第六章 树 Words And Expressions  acyclic graph 无圈图  forest 森林  eccentricity 离心率 Special kind of graph  Definition 6.1.1 A graph is acyclic if it contains no subgraph isomorphic to a cycle Cn.  Definition 6.1.3 A tree is an acyclic connected graph.  Example: Which of graphs are trees? Definition 6.1.2 A forest is an acyclic graph, but is not connected. Each of the connected components in a forest is a tree. Properties of trees  Theorem 6.1.1 A connected graph with n vertices is a tree if and only if it has exactly n-1edges.  Theorem 6.1.2A connected graph is a tree if and only if every edge in the graph is a cut- edges. Properties of Trees Theorem 2: A tree with n vertices has n − 1 edges. Proof (by mathematical induction): BASIS STEP: When n = 1, a tree with one vertex has no edges. Hence, the theorem holds when n = 1. INDUCTIVE STEP: Assume that every tree with k vertices has k − 1 edges. Suppose that a tree T has k + 1 vertices and that v is a leaf of T. Let w be the parent of v. Removing the vertex v and the edge connecting w to v produces a tree T′ with k vertices. By the inductive hypothesis, T′ has k − 1 edges. Because T has one more edge than T′, we see that T has k edges. This completes the inductive step. Theorem6.1.3 : An undirected graph is a tree if and only if there is a unique walk between any two of its vertices. Proof: Assume that T is a tree. Then T is connected with no circuits. Hence, if x and y are distinct vertices of T, there is a trail between them .This trail must be unique - for if there were a second path, there would be a circuit in T.Hence, there is a unique trail between any two vertices of a tree. Now assume that there is a unique