Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

The Chinese Postman Problem Route Planning Map Colouring
© 2008 Pearson Addison-Wesley. All rights reserved Chapter 13 Mathematics and Business.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
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.
Graph Theory: Euler Circuits Christina Mende Math 480 April 15, 2013.
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.
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.
Konigsberg Bridge Problem
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.
Graph Theory. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
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
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graphs and Euler cycles Let Maths take you Further…
Discrete Math Round, Round, Get Around… I Get Around Mathematics of Getting Around.
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.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
EECS 203: It’s the end of the class and I feel fine. Graphs.
Graph Theory Topics to be covered:
Graph Theory Hamilton Paths and Hamilton Circuits.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
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.
CSE, IIT KGP Euler Graphs and Digraphs. CSE, IIT KGP Euler Circuit We use the term circuit as another name for closed trail.We use the term circuit as.
Euler and Hamilton Paths
Chinese postman problem
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
2003 ICTM Contest Division A Orals Topic: Graph Theory
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
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Graphs, Puzzles, & Map Coloring
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Chapter 14 Section 4 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
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.
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.
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
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.
Chapter 6: Graphs 6.1 Euler Circuits
Chapter 5: The Mathematics of Getting Around
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
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.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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,
Nuffield Free-Standing Mathematics Activity
Discrete Maths 9. Graphs Objective
This unit is all about Puzzles Games Strategy.
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graph Theory.
Genome Assembly.
Nuffield Free-Standing Mathematics Activity
Decision Maths Graphs.
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Euler and Hamilton Paths
Graph Theory: Euler Graphs and Digraphs
Presentation transcript:

Structures 7 Decision Maths: Graph Theory, Networks and Algorithms

Königsberg Bridge Problem Is it possible to walk around the town, crossing every bridge exactly once?

Generalising the Königsberg Bridge problem: How can you decide whether a given graph is traversable or not? Where should you start tracing?

Euler’s relation for planar graphs v = number of vertices e = number of edges f = number of faces (including the ‘infinite’ face) v – e + f = 2 XX X

and Euler’s relation for solids

what about …?

Network problems and algorithms minimum connector problem minimum length of cable required to connect all towns shortest path shortest route between two towns travelling salesman minimum distance needed to visit all towns Chinese postman minimum distance to travel along every road