Chapter 6: Graphs 6.1 Euler Circuits

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

© 2008 Pearson Addison-Wesley. All rights reserved Chapter 13 Mathematics and Business.
Chapter 8 Topics in Graph Theory
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Graph-02.
1 Lecture 5 (part 2) Graphs II Euler and Hamiltonian Path / Circuit Reading: Epp Chp 11.2, 11.3.
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
AMDM UNIT 7: Networks and Graphs
The Seven Bridges Of Konigsberg.
Pamela Leutwyler. A river flows through the town of Konigsburg. 7 bridges connect the 4 land masses. While taking their Sunday stroll, the people of Konigsburg.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
A Presentation By: Jillian Minuto Troy Norman Alan Leggett Group Advisor: Prof. G. Warrington Graph Theory.
Euler Graphs Section Euler Graphs 2 Circuit? Path? Non- traversable? A D E C B A D E C B A D E C B End at A End at B Start at A Miss an edge.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
Graphs. Graph A “graph” is a collection of “nodes” that are connected to each other Graph Theory: This novel way of solving problems was invented by a.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Euler Circuit Chapter 5. Fleury’s Algorithm Euler’s theorems are very useful to find if a graph has an Euler circuit or an Euler path when the graph is.
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.
Discrete Math Round, Round, Get Around… I Get Around Mathematics of Getting Around.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
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.
Can you find a way to cross every bridge only once?
Take a Tour with Euler Elementary Graph Theory – Euler Circuits and Hamiltonian Circuits Amro Mosaad – Middlesex County Academy.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
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.
5.7 Eulerizing Graphs. Euler circuit and Euler path do not always exist. There are many graphs (in real life) that have more than 2 odd vertices. Instead.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.
Lesson Reflection for Chapter 14 Section 6 Pre-Algebra Learning Goal Students will understand collecting, displaying, & analyzing data.
Graphs, Puzzles, & Map Coloring
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.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Introduction to Graph Theory
Aim: What is an Euler Path and Circuit?
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
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
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
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 Paths and Cycles. What is a Eulerian Path Given an graph. Find a path which uses every edge exactly once. This path is called an Eulerian Path.
1.Quiz 5 due tomorrow afternoon in E309 from 1pm to 4pm. 2.Homework grades will be based on ten graded homework assignments (dropping the lowest one).
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Lecture 52 Section 11.2 Wed, Apr 26, 2006
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.2 Euler Paths, and Euler Circuits.
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
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.
Hamilton Paths and Circuits 1 Click to Start 2 3 Start End.
Fleury's Algorithm Euler Circuit Algorithm
Excursions in Modern Mathematics Sixth Edition
Euler Paths and Circuits
Konigsberg’s Seven Bridges
Discrete Structures – CNS2300
Discrete Math: Hamilton Circuits
Can you draw this picture without lifting up your pen/pencil?
Euler Paths and Circuits
This unit is all about Puzzles Games Strategy.
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Walks, Paths, and Circuits
A path that uses every vertex of the graph exactly once.
Konigsberg- in days past.
Euler and Hamilton Paths
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
A Survey of Mathematics with Applications
Presentation transcript:

Chapter 6: Graphs 6.1 Euler Circuits

The Königsberg Bridge Problem Can you cross each bridge once and only once, and return to your starting point?

Graphs: Dots and Connections Dots are called vertices (one dot is one vertex) Connections are called edges Graphs are good ways to model connections between things, for example: Bridges between land masses Connections between computers on a network People who know each other Flights between cities

The Bridge Map as a Graph Now the question is: Can you traverse each edge once and only once, and get back to your starting vertex? (Such a path in a graph is called an Euler Circuit; some graphs have them and some don’t.)

What We Just Found In order for a graph to have an Euler Circuit, it must: Be connected, and Every vertex in the graph must have an even number of edges “sprouting” from it. (Note: the number of “sprouts” from a vertex is called the degree of the vertex, so every vertex must have even degree)

Euler Circuit Theorem A graph that has an Euler Circuit must be connected and every vertex must have even degree. Furthermore, any graph will those two properties will always have an Euler Circuit. (To find an Euler Circuit in such a graph, you can start at any vertex and just keep following edges until you get back to your starting point, and then add in any loop-de-loops you need to use up all the edges.)

More Examples

More Examples

More Examples

Euler Paths Sometimes you can’t get back to where you started, but you can cross each edge once and only once. This is called an Euler Path. Example:

Euler Paths So, when does a graph have an Euler Path?

Euler Paths So, when does a graph have an Euler Path? Think about the starting and ending points – what degree should those vertices have?

Euler Paths So, when does a graph have an Euler Path? Think about the starting and ending points – what degree should those vertices have? What about the rest of the vertices – what degree should those vertices have?

Euler Path Theorem A graph has an Euler Path (but not an Euler Circuit) if and only if exactly two of its vertices have odd degree and the rest have even degree. (The odd vertices will be the starting and ending vertices of the Euler Path.)