离散数学课件6.2 graph terminology and Special Types of Graphs.pptVIP

Section 6.2 Graph Terminology 图的术语 Undirected Graphs Definition: Two vertices u, v in V are adjacent 邻近or neighbors相邻 if there is an edge e between u and v. If e={u,v}, the edge e is called incident with the vertices u and v. The vertices u and v are called endpoints of e. ____________________ Definition: The degree of a vertex v in an undirected graph is the number of edges incident with it, except that a loop at a vertex contribute twice to the degree of that vertex. The degree of the vertex v is denoted by deg(v). ? If deg(v) = 0, v is called isolated孤立的. ? If deg(v) = 1, v is called pendant稳定的. d(v1)=4 d(v2)=4 d(v3)=3 d(v4)=1 d(v5)=0 Example: The Handshaking Theorem握手定理: Let G = (V, E) be an undirected graph with e edges. Then Proof: Each edge represents contributes twice to the degree count of all vertices. Q. E. D. __________________ Example How many edges are there in a graph with 10 vertices each of degree 6? Solution: Since the sum of the degrees of the vertices is 6·10=60, it follows that 2e=60. Therefore, e=30. Example: If a graph has 5 vertices, can each vertex have degree 3? 4? ? The sum is 3?5 = 15 which is an odd number. Not possible. ? The sum is 20 = 2 | E | and 20/2 = 10. May be possible. Theorem2: A graph has an even number of vertices of odd degree. Proof: Let V1 = vertices of odd degree V2= vertices of even degree Then Q. E. D. Since deg(v) is even for v?V1,the first term in the right-hand side is even.Furthermore, the sum of the two terms on the right-hand side is even, since this sum is 2e.Hence,the second term in the sum is also even. Since the second term is the sum of odd degrees, there must be an even number of vertices of odd degree. Example: It is not possible to have a graph with 3 vertices each of which has degree 1. Directed Graphs Definition: Let u, v be an edge in G. Then u is an initial vertex初始点 and is adjacent to v and v is a terminal vertex终结点 and is adjacent from u. The initial vertex and terminal vertex of a