Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…

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
CS1022 Computer Programming & Principles Lecture 7.1 Graphs (1)
Chapter 8 Topics in Graph Theory
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Discrete Maths Chapter 5: Route Inspection Lesson 1: Chinese Postman.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
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.
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.
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 and Trees This handout: Eulerian Cycles: Sufficiency of the condition Hamiltonian tour.
IEOR266 © Classification of MCNF problems.
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 5,Wednesday, September 10.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Graphs and Trees This handout: Terminology of Graphs Applications of Graphs.
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.
Management Science 461 Lecture 9 – Arc Routing November 18, 2008.
Chapter 4: Finding the Shortest Path Lesson 1: Dijkstra’s Algorithm
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
Chinese Postman Algorithm Aims: To be able to use the Chinese Postman Algorithm for: all even vertices. 2 odd vertices. Starting and ending at the same.
Chinese postman problem
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Graph Algorithms Mathematical Structures for Computer Science Chapter 6 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesGraph Algorithms.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Lesson Reflection for Chapter 14 Section 6 Pre-Algebra Learning Goal Students will understand collecting, displaying, & analyzing data.
Graphs, Puzzles, & Map Coloring
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
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.
Discrete Mathematical Structures: Theory and Applications
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.
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
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.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Chapter 6: Graphs 6.1 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.
Lecture 16: Graph Theory III Discrete Mathematical Structures: Theory and Applications.
Introduction to Graph Theory
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.
STARTER: CAN YOU FIND A WAY OF CROSSING ALL THE BRIDGES EXACTLY ONCE? Here’s what this question would look like drawn as a graph.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Networks.
Discrete Maths 9. Graphs Objective
Spanning Trees Discrete Mathematics.
Discrete Math: Hamilton Circuits
Network Notes Ms Allan 2012 AS91260 (2.5) Designed to teach from,
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graph.
Lecture 15: Graph Theory II
THE CHINESE POSTMAN PROBLEM Liz Biz and Hells Bells.
Foundations of Discrete Mathematics
Nuffield Free-Standing Mathematics Activity
Lecture 19-Problem Solving 4 Incremental Method
Chapter 4: Finding the Shortest Path Lesson 1: Dijkstra’s Algorithm
Decision Maths Graphs.
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
Eulerian Cycles in directed graphs
Applied Combinatorics, 4th Ed. Alan Tucker
Chapter 10 Graphs and Trees
Graph Theory: Euler Graphs and Digraphs
Presentation transcript:

Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler… Discrete Maths Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…

Where graph theory came from…

Where graph theory came from…

Let’s learn some definitions…

Trail (or route)

Closed Trail

Path

Cycle

Order

Connected Graph

Eulerian Graph A connected graph which has a closed trail containing every arc precisely once A B C D A B C D E √ X CHECK: A connected graph is Eulerian if and only if every node has an even order

A wee puzzle… F D B C E A

Semi-Eulerian Graph A graph which has a trail that is not closed that contains every arc precisely once F D B C E A CHECK: A connected graph is Semi-Eulerian if and only if precisely two nodes have odd order

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2024 SlidePlayer.com Inc. All rights reserved.