UNIT 1: EULER CIRCUITS GRAPH THEORY.

Slides:



Advertisements
Similar presentations
Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.
Advertisements

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.
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.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
Math for Liberal Studies.  Here is a map of the parking meters in a small neighborhood  Our goal is to start at an intersection, check the meters, and.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
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.
Amusement park project
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.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
Graph Theory Introducton.
Introduction to Graph Theory
Graphs, Paths & Circuits
Chapter 14 Section 4 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Chapter 1: Urban Services Lesson Plan
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
AND.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Chapter 6: Graphs 6.1 Euler Circuits
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
EULER PATHS & CHINESE POSTMAN SOL: DM.2 CLASSWORK WORKSHEET HOMEWORK (DAY 59) WORKSHEET.
1) Find and label the degree of each vertex in the graph.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits.
Classwork Quiz Worksheet Homework (day 54) Worksheet (1-7) Walks, Paths and Circuits SOL: DM.1.
Today we will… Identify the vertices and edges on a given shape.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2009 Pearson Education, Inc. Chapter 14 Section 1 – Slide Graph Theory Graphs, Paths & Circuits.
Excursions in Modern Mathematics Sixth Edition
Hamilton Paths and Hamilton Circuits
Euler and Hamiltonian Graphs
AND.
Konigsberg’s Seven Bridges
Graph Theory Unit 2.
Amusement park project
The Taxi Scheduling Problem
Can you draw this picture without lifting up your pen/pencil?
Euler Paths and Circuits
This unit is all about Puzzles Games Strategy.
Graph Theory.
Lecture 15: Graph Theory II
Introduction to Vertex-Edge graphs (2 days)
Chapter 1: Urban Services Lesson Plan
Walks, Paths, and Circuits
A path that uses every vertex of the graph exactly once.
Konigsberg- in days past.
Cornell Notes: Euler Paths and Circuits
Graphs, Paths & Circuits
Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Euler and Hamilton Paths
Hamilton Paths and Hamilton Circuits
Chapter 1: Urban Services Management Science
Euler circuit Theorem 1 If a graph G has an Eulerian path, then it must have exactly two odd vertices. Theorem 2 If a graph G has an Eulerian circuit,
Section 14.1 Graphs, Paths, and Circuits
Euler Paths and Euler Circuits
CHAPTER 15 Graph Theory.
Graphs, Paths, and Circuits
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Warm Up – 3/17 - Monday A) List the set of vertices.
Chapter 1: Urban Services Lesson Plan
A Survey of Mathematics with Applications
Presentation transcript:

UNIT 1: EULER CIRCUITS GRAPH THEORY

TURNING MAPS INTO GRAPHS

TURNING GRAPHS INTO MAPS

Definitions Valence: The number of edges meeting at a vertex is considered the vertex’s valence. Circuit: A connected series of edges that starts and ends at the same vertex (special path).

Label the valences of all of the vertices of the following graph:

Declare whether or not the following graphs are circuits: B C D

Definition: Euler Circuit: A circuit that covers every edge of a graph exactly one time.

Find (if possible) the Euler Circuit

Find (if possible) the Euler Circuit:

Literacy Practice Read section 1.3 starting on page 11 and finishing on page 12.

Eulerization Graphs are Euler circuits when ___________________________. Eulerizing a graph is when EDGES are added to the graph until an Euler circuit exists.

What is the minimum number of edges needed to eulerize the following graphs:

Minimum number of edges to Eulerize The minimum number of edges needed to Eulerize a graph is based on the following equation: (# odd valences)/2

Eulerize the following graphs with the fewest edges possible.

Draw a small map of a city and have your neighbor draw a graph that represents and efficient route around that city. You will be required to complete this on the test, so use this time wisely to practice.

Jobs that use Euler Circuits: Trash Collection Companies Political Candidates Delivery Services (Post Office, FedEx, UPS, etc.) Yard maintenance services Warehouse operators Police officers More