离散数学课件6-5 Euler and Hamilton Paths 64.pptx

Discrete Mathematics South China University of TechnologyChapter 8. GraphsEuler and Hamilton PathsSection 8.5Contents1Euler Paths and Circuit2Hamilton Paths and CircuitEuler Paths and CircuitKonigsberg Seven Bridges ProblemKonigsberg Seven Bridges ProblemThe original problemEquivalent multigraphThe Swiss mathematician Leonhard Euler solved this problem. His solution, published in 1736, may be the first use of graph theory.Euler studied the problem by using a multiple graph.Euler circuitDefinition 1: An Euler circuit in a graph G is simple circuit containing every edge of G.An Euler path in G is a simple path containing every edge of G.No solution!!abedcG1Example 1The graph G1 has an Euler circuit, for example a, e, c, d, e, b, a.abedcG2Example 1G2 does not have an Euler circuit.G2 does not have an Euler path, either.abdceG3Example 1G3 does not have an Euler circuit.G3 has an Euler path: a, c, d, e, b, d, a, b.Necessary Conditions lemma: If a connected graph has an Euler circuit, then every vertex must have even degree.Observation: Each time the circuit passes through a vertex a it contributes two to the vertex’s degree, since the circuit enters via an edge incident with this vertex and leaves via another such edge.Necessary ConditionsTherefore, deg(a) must be even, because the circuit contributes two every time when it passes through a. Therefore, if a connected graph has an Euler circuit, then every vertex must have even degree.Necessary condition!!!Sufficient Conditionslemma: If all vertices have even degree in a connected multigraph, then an Euler circuit exists.The proof is given with a construction.abadcfeBasic idea of construction: abadcfeExample of construction we can build simple circuit C1 =afcba , C2 =cdecFinally, we splice them: afcdecbaDetailed proofSuppose that the degree of every vertex of G is even. we can build a simple circuit C1 ={x0=a,x1},{x1,x2},…,{xn-1,xn=a} where a is an arbitrary vertex. Because :1. The graph is connected,2. Each time the