Joining Can you teach graph theory with this game?

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

Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,
Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
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.
Read the numbers out loud and draw a line to join them
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
Five Problems CSE 421 Richard Anderson Winter 2009, Lecture 3.
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.
IEOR266 © Classification of MCNF problems.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
> >
W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Chapter 4 Graphs.
Degree A F H G B E D C. Adjacent A F H G B E D C.
Take a Tour with Euler Elementary Graph Theory – Euler Circuits and Hamiltonian Circuits Amro Mosaad – Middlesex County Academy.
Graph Theory in Computer Science
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Drawing Straight Line Graphs
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.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.2, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Discrete Mathematical Structures: Theory and Applications
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Monkey, Monkey In the Tree. Monkey, monkey in the tree Throw the yellow coconut down to me!
David Stotts Computer Science Department UNC Chapel Hill.
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.
Machine-Independent Optimizations Ⅳ CS308 Compiler Theory1.
1.Which of the following is NOT an algorithm? a.A set of instructions used to build a wardrobe b.A flow chart used to solve a quadratic equation c.A note.
MAT 2720 Discrete Mathematics Section 8.1 Introduction
Solve: 1) x + 5 = 9. x + 5 > 9 2) y – 6 = -3
Graph Theory and Optimization
Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.
Konigsberg’s Seven Bridges
Section 2: Multiple choice
Introduction to Graph Theory
Sketching the Derivative

Planar Graphs & Euler’s Formula
Spanning Trees Discrete Mathematics.
Network Notes Ms Allan 2012 AS91260 (2.5) Designed to teach from,
This unit is all about Puzzles Games Strategy.
Quiz Review.
Lecture 15: Graph Theory II
Edmonds-Karp Algorithm
Qualitative Data Quantitative Data vs.
4-4 Graph Theory Trees.
Lecture 19-Problem Solving 4 Incremental Method
Walks, Paths, and Circuits
CSE 421 Richard Anderson Autumn 2016, Lecture 3
Konigsberg- in days past.
CSE 421 Richard Anderson Autumn 2015, Lecture 3
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.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Drawing Graphs The parabola x Example y
Maximum Flow Neil Tang 4/8/2008
CSE 421, University of Washington, Autumn 2006
Warm Up – Monday Calculate the Redundancy of the above network.
Draw dots using 2 colors to find the “Make 10” fact.
LINEAR & QUADRATIC GRAPHS
Line Graphs.
CSE 421 Richard Anderson Autumn 2019, Lecture 3
Drawing a graph
Presentation transcript:

Joining Can you teach graph theory with this game?

Match Dots Find a Hamiltonian path. You draw the edges to create the network.

Match Dots Find a Hamiltonian path. You draw the edges to create the network.

Trees Look at Pink. Which is the best part of the tree to get?

Where to start Blues: Which is the best one to start at and is there a way to tell this?

Where to start Blues: Which is the best one to start at and is there a way to tell this?

Where to start Blues: Which is the best one to start at and is there a way to tell this?

Where to start Pink: Which is the best route to take and is there a way to tell this?

Where to start Pink: Which is the best route to take and is there a way to tell this?

Where to start Pink: Which is the best route to take and is there a way to tell this?

Other ‘mathematical’ games

Flow

Unblock me

Quell

Dot