Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.

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

CSE 211 Discrete Mathematics
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
BY: MIKE BASHAM, Math in Scheduling. The Bridges of Konigsberg.
Decision Maths Graphs Wiltshire Graphs A graph is just a diagram made up of “dots” and “lines”. These are all graphs. The dots are called “nodes” or.
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.
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.
Euler and Hamilton Paths
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
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.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
Can you find a way to cross every bridge only once?
GRAPH Learning Outcomes Students should be able to:
Take a Tour with Euler Elementary Graph Theory – Euler Circuits and Hamiltonian Circuits Amro Mosaad – Middlesex County Academy.
EECS 203: It’s the end of the class and I feel fine. Graphs.
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Euler and Hamilton Paths
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.
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.
Introduction to Graph Theory
Graphs Edge(arc) Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This graph is connected. Degree(order) = 3 Odd vertex.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
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.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Chapter 6: Graphs 6.1 Euler Circuits
Aim: Graph Theory – Paths & Circuits Course: Math Literacy Do Now: Aim: What are Circuits and Paths? Can you draw this figure without retracing any of.
Introduction to Graph Theory
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.
Grade 11 AP Mathematics Graph Theory Definition: A graph, G, is a set of vertices v(G) = {v 1, v 2, v 3, …, v n } and edges e(G) = {v i v j where 1 ≤ i,
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Graphs: Definitions and Basic Properties
Konigsberg’s Seven Bridges
Discrete Structures – CNS2300
Spanning Trees Discrete Mathematics.
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
Lecture 15: Graph Theory II
Genome Assembly.
Walks, Paths, and Circuits
Konigsberg- in days past.
Decision Maths Graphs.
Graph Theory What is a graph?.
Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.
Euler and Hamilton Paths
Section 14.1 Graphs, Paths, and Circuits
Graphs, Paths, and Circuits
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Chapter 10 Graphs and Trees
Hamilton Paths and Circuits
Warm Up – 3/17 - Monday A) List the set of vertices.
Presentation transcript:

Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX IS CALLED ODD IF IT HAS AN ODD NUMBER OF ARCS LEADING TO IT, OTHER WISE IT IS CALLED EVEN. DEFINITION: AN EULER PATH IS A CONTINUOUS PATH THAT PASSES THROUGH EVERY ARC ONCE AND ONLY ONCE.

Review cont…  Circuits Circuit- a closed path, with no other repeated vertices than the starting and ending vertices Electrical circuit, an electrical network that has a closed loop giving a return path for the current Electrical circuit Paths- a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. Edges- An edge is a line segment that joins two vertices. Vertices- A vertex (plural: vertices) is a point where two or more straight lines meet. Basically it’s a corner.

Review cont… Euler’s Circuits  A path on a graph that starts and ends of the same vertex, it uses each edge exactly once.  He first explored this idea in 1736 with his Seven Bridges of Konigsberg Problem.  It is not a Eulerian Circuit unless all of it’s vertices have an even degree. Examples Of Jobs that use Eulerian’s Circuits:  Parker Meters/Meter Maid- The basic premise of an Euler circuit is that you have a set of pathways, lined with parking meters, that need to be traversed. Each pathway begins and ends at a node (a street corner). The goal is to find a way that visits each pathway once, and only once. It's hard work emptying parking meters, & you want to avoid doing any more work than you have to. You can visit each node as many times as you want, but can only walk down each pathway once. You also need to end up where you started.

Review cont…  Hamilton Circuit  A circuit that starts at a vertex of a graph, passes through every vertex exactly once, and returns to the starting vertex.  The vertices do not need to be of even degree  The “Optimal Hamiltonian Path,” is that in which the least slides are used. Example of Jobs that use Hamilton Circuit: When home developers plan out a new community they use Hamilton’s Circuit to make sure there are multiple ways to exit the community. Another example is going through Corn Mazes.