Discrete Mathematics 离散数学——图论
定理: The Hand Shaking Theorem
Hand Shaking Theorem: Let G = (V, E) be an undirected graph with m edges, then
Proof: Each edge contribute twice to the sum of the degrees of vertices, so the sum of the degrees is twice the number of edges.
Corollary of HS Theorem(推论): An undirected graph has an even number of vertices of odd degree.
证明非常简单,因为总的度数是偶数(2m),所以只可能有奇数条边(否则度数出现奇数)
基本的图
Complete graph Kn
The complete graph is the graph with n vertices and an edge connecting each pair of distinct(不同的) vertices. (n >= 1)