Introduction to Euler graph Nguyen Ngoc Trung Hochiminh University of Pedagogy

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Graph-02.
Hamiltonian Circuits and Paths
Chapter 7 Graph Theory 7.1 Modeling with graphs and finding Euler circuits. Learning Objectives: Know how to use graphs as models and how to determine.
1 Lecture 5 (part 2) Graphs II Euler and Hamiltonian Path / Circuit Reading: Epp Chp 11.2, 11.3.
AMDM UNIT 7: Networks and Graphs
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.
Open an internet browser such as internet explorer.
Graphs and Trees This handout: Eulerian Cycles: Sufficiency of the condition Hamiltonian tour.
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 5,Wednesday, September 10.
Euler and Hamilton Paths
D1: Matchings.
Traveling-Salesman Problem Ch. 6. Hamilton Circuits Euler circuit/path => Visit each edge once and only once Hamilton circuit => Visit each vertex once.
What is the first line of the backwards direction of this proof? 1.Assume G is a block. 2.Assume every pair of vertices lie on a common cycle. 3.Assume.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Eulerian Circuits. A Warm Up Problem Jenny & John were at a Math Circles event with three other couples. As people arrived, various handshakes took place.
Introduction to Graph Theory
Take a Tour with Euler Elementary Graph Theory – Euler Circuits and Hamiltonian Circuits Amro Mosaad – Middlesex County Academy.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
Euler and Hamilton Paths
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.
CS 200 Algorithms and Data Structures
5.4 Graph Models (part I – simple graphs). Graph is the tool for describing real-life situation. The process of using mathematical concept to solve real-life.
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Topics Paths and Circuits (11.2) A B C D E F G.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
AND.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Chapter 6: Graphs 6.1 Euler Circuits
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
Introduction to Graph Theory
1) Find and label the degree of each vertex in the graph.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
9.5 Euler and Hamilton graphs. 9.5: Euler and Hamilton paths Konigsberg problem.
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
Konigsberg’s Seven Bridges
1-1 RELATIONS & FUNCTIONS
Discrete Math: Hamilton Circuits
Can you draw this picture without lifting up your pen/pencil?
Euler Paths and Circuits
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graph Theory.
Lecture 15: Graph Theory II
Walks, Paths, and Circuits
Konigsberg- in days past.
Graph Theory What is a graph?.
5 The Mathematics of Getting Around
Year 6 (National Numeracy Strategy) (Based on DFEE Sample Lessons)
Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Euler and Hamilton Paths
Year 6 (National Numeracy Strategy) (Based on DFEE Sample Lessons)
Euler Paths and Euler Circuits
Warm Up – Tuesday Find the critical times for each vertex.
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
5 The Mathematics of Getting Around
Presentation transcript:

Introduction to Euler graph Nguyen Ngoc Trung Hochiminh University of Pedagogy

Introduction to Euler graph Introduction Process Evaluation Conclusion

Introduction Euler graph plays an very important role in many applications of graph. You will know concept of Euler graph after this lesson. Properties of Euler graph are also explored within this lesson. Some more research on Euler have to be done by students. Back to main page

Process Activity 1. Games Consider two figures, can you draw them by a continuous line, starting and finishing at a same point? Back to main page Figure 1. Figure 2.

Answer!!!! Only Figure 2 can be drawn.

Process (cont) Activity 2. Study concept of Euler graph Figure 2 is an example of Euler graph. An Euler graph is a graph that has a single circuit pass through all its edges. Back to main page Figure 1. Figure 2.

Process (cont) Activity 3. Point out properties of Euler graph What is the difference between Fig 1. and Fig. 2 that Fig 2 can not be drawn? Hint: Attention to degree of vertices!!!! Back to main page Figure 1. Figure 2.

Answer!!! All vertices of graph in Fig. 2 have even degree while graph in Fig. 1 has two vertices that have odd degree. Back to main page Figure 1. Figure 2.

Process (cont) Activity 3. (cont) Conjecture: An Euler graph has all its vertices which have even degree??? And vice versa? That is true. Go to website: and discover the theorem and the proof. Documents:

Process (cont) Activity 4. How to find Euler circuit? Back to Fig. 2. How can it be drawn? Fail!!!

Process (cont) Activity 4. How to find Euler circuit? Visit following website to watch the demonstration of finding Euler circuit Task (homework): 3 groups (4 students each group): Group Research algorithm for finding Euler circuit and present next time in class. Build a program in C/C++ for finding Euler circuit based on researched algorithm. Expected products: a report and a program

Process (cont) Activity 4. (cont) Resources: ACM ACM 5.html 5.html

Process (cont) Activity 5. Applications of Euler graph? Task (homework): 3 groups (4 students each group): Group Research and present application of Euler graph. Expected products: A report (5-10 pages) about applications of Euler graph.

Process (cont) Activity 5. (cont) Resources: eory.htm eory.htm r2004.pdf r2004.pdf ype=pdf&coll=&dl=ACM&CFID= &CFTOKE N= ype=pdf&coll=&dl=ACM&CFID= &CFTOKE N=

Evaluation Back to main page Score Follow Direction I didn’t follow at all I read the direction but skipped directions or did not follow them completely. I followed the directions completely and did everything I was asked to do. Understanding concept of Euler graph I didn’t understand at all I can understand a part of concept I understand the concept Understanding property of Euler graph I didn’t understand at all I got sense about the property but the proof is too difficult for me to understand I understand the property and the proof. Group works I cannot do anything I can understand the theory but cannot program I got expected products

Conclusion We call “Euler graph” because it is first developed by Euler – a Swiss Mathematician. At this point, we can understand the concept, property and application of Euler graph. Future works: Hamilton graph Finding shortest path problem … Back to main page