离散数学1精品教学（华南理工大学）Review Tree.pptVIP

Chapter 7 Trees Section 7.1 Introduction to trees Introduction A tree T is a simple graph such that for every pair of vertices v and w, there is a unique path from v to w Definition: A tree is a connected undirected graph with no simple circuits. ____________________ Note: A tree cannot contain multiple edges or loops. Tree If v and w are vertices in T ,there is a unique simple path from v to w . T is connected and acyclic. T is connected and has n –1 edges. T is acyclic and has n –1 edges. 5. A connected graph where removing any edge leaves a disconnected graph Equivalent Definitio