《Discrete Mathematics II教学-华南理工》6.5 Euler and Hamilton Path.pptVIP

Section 6.5 Euler and Hamilton Path Definition 1. An Euler circuit in a graph G is a simple circuit containing every edge of G. An Euler path in G is a simple path containing every edge of G. Euler circuit and path Which of the undirected graphs have an Euler circuit? Of those that do not, which have an Euler path? Solution Neither of the graph (1) nor (2) has an Euler circuit and Euler path. The graph (3) has an Euler path and (4) has an Euler circuit. Example （a） （b） （c） Which of the following directed graphs have an Euler circuit? Of those that do not, which have an Euler path? Solution The graph (1) has an Euler circuit and the graph (2) has an Euler path. The graph (3) has neither an Euler path nor an Euler circuit. Example In a simple cycle, whenever path enters vertex, must come out on different edge. Thus every visit of v contributes 2 to deg(v). Thus, if keep only edges which were on the simple cycle, degrees of resulting graph are all even. But in an Eulerian graph G, can find a simple cycle containing all vertices and consequently graph resulting from cycle is G itself! Necessary and sufficient conditions for Euler circuits and paths Theorem 1. A connected multigraph has an Euler circuit if and only if each of its vertices has even degree. Necessary and sufficient conditions for Euler circuits and paths Theorem 2. A connected multigraph has an Eular path but not an Euler circuit if and only if it has exactly two vertices of odd degree. （1）has an Euler circuits since each of its vertices has even degree. （2）has an Euler circuits. （3）has an Euler path since it has exactly two vertices of odd degree. Necessary and sufficient conditions for Euler circuits and paths G1 has an Euler circuits since each of its vertices has even degree and the out-degree equals to the in-degree for every vertex. G2 has an Euler path . G1 G2 G3 G3 has neither an Euler path nor an Euler cir