fun with graph theory · a graph is a mathematical object consisting of cities (vertices) joined by...
TRANSCRIPT
![Page 1: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/1.jpg)
Fun with Graph Theory
Presented by Melissa McGuirl
![Page 2: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/2.jpg)
Goals for Today● Learn about graph theory
● Learn about the graph number and graph formula
● Learn about the color number
● Have fun with math
![Page 3: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/3.jpg)
What is Graph theory??
![Page 4: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/4.jpg)
A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges).
Our Rules: 1. Each road must connect exactly two cities. We allow the graph of a
single city with no roads.2. Roads can not cross each other.3. The graph is connected, meaning you can get from one city to any
other city by traveling on the roads.
![Page 5: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/5.jpg)
Is this a graph?
Why? Or why not?Providence
Boston
Worcester
![Page 6: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/6.jpg)
Is this a graph?
Why? Or why not?Philadelphia
New York City
Atlantic City
![Page 7: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/7.jpg)
This Graph has:- 8 cities- 11 roads- 5 regions
![Page 8: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/8.jpg)
How can we characterize Graphs??
![Page 9: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/9.jpg)
❖ Leonhard Euler, Swiss Mathematician (1707-1783)
❖ Studied Graph Theory❖ Discovered something
very interesting about connected, planar graphs when studying #Cities - #Roads + #Regions
![Page 10: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/10.jpg)
(number of cities) - (number of roads) + (Number of regions) is called the Graph number of a graph.
![Page 11: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/11.jpg)
Example 1
#Cities = ___#Roads = ___#Regions = ___
#Cities - #Roads + #Regions = ___
![Page 12: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/12.jpg)
Example 1
#Cities = 3#Roads = 3#Regions = 2
#Cities - #Roads + #R = 2
![Page 13: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/13.jpg)
Example 2
#Cities = ___#Roads = ___#Regions = ___
#Cities - #Roads + #Regions = ___
![Page 14: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/14.jpg)
Example 2
#Cities = 4#Roads = 5#Regions = 3
#Cities - #Roads + #Regions = 2
![Page 15: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/15.jpg)
Example 3
#Cities = ___#Roads = ___#Regions = ___
#Cities - #Roads + #Regions = ___
![Page 16: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/16.jpg)
Example 3
#Cities = 5#Roads = 7#Regions = 4
#Cities - #Roads + #Regions = 2
![Page 17: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/17.jpg)
Example 4
#Cities = ___#Roads = ___#Regions = ___
#Cities - #Roads + #Regions = ___
![Page 18: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/18.jpg)
Example 4
#Cities = 8#Roads = 10#Regions = 4
#Cities - #Roads + #Regions = 2
![Page 19: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/19.jpg)
Can you draw your own graph and compute its graph number?
![Page 20: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/20.jpg)
What do you observe??
![Page 21: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/21.jpg)
Graph Formula for connected flat graphs:
#cities - #roads + #Regions = 2
![Page 22: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/22.jpg)
Is the graph Formula always true? Why?
![Page 23: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/23.jpg)
SImplest graph
#Cities = 1#Roads = 0#Regions = 1
#Cities - #Roads + #Regions = 2
![Page 24: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/24.jpg)
What if we add a connected city?
#Cities = 1 + 1 = 2#Roads = 0 + 1 = 1#Regions = 1
#Cities - #Roads + #Regions = 2
![Page 25: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/25.jpg)
What if we add another connected
City?#Cities = 2 +1 = 3#Roads = 1 + 1 = 2#Regions = 1
#Cities - #Roads + #Regions = 2
![Page 26: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/26.jpg)
What if we add a region?
#Cities = 3#Roads = 3#Regions = 2
#Cities - #Roads + #Regions = 2
![Page 27: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/27.jpg)
- The graph formula holds for simplest graph of just 1 city- Adding a connecting city or region does not change the
graph number- We conclude the graph formula holds for all connected flat
graphs
![Page 28: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/28.jpg)
Now that we know what a graph is, let’s experiment with colors!Our Rules: 1. Each road must connect exactly two cities. 2. The graph is connected, meaning you can get from one
city to any other city by traveling on the roads.
![Page 29: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/29.jpg)
Color all the cities of your graph.
Rule: cities that share a road cannot have the same Color.
![Page 30: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/30.jpg)
How many colors did we use? Can we do it with less?
![Page 31: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/31.jpg)
Here we only use 3 colors!
![Page 32: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/32.jpg)
Challenge: Find the fewest number of colors Needed so that connected vertices have different colors.
![Page 33: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/33.jpg)
Example 6 : Cycle graphs
![Page 34: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/34.jpg)
Example 7: A complete graph is a graph where you can get from any
city to any other city by a direct road
![Page 35: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/35.jpg)
The color number of a graph is the smallest number of colors needed to color a graph by our Rule.
![Page 36: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/36.jpg)
Find the color number of the graphs you generated earlier today.
![Page 37: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/37.jpg)
What do we know about the color number of a graph?
![Page 38: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/38.jpg)
★ The color number must be more than 1, unless the graph has no edges.
★ The color number is less than or equal to the total number of cities in your graph, and for complete graphs the color number equals the number of cities in your graph.
★ Cycle graphs have color number = 2 if the number of cities is even, and color number = 3 if the number of cities is odd.
![Page 39: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/39.jpg)
What did we learn today?
● Definition of a graph
● Applications of graph theory
● The Euler characteristic (graph number)
● Euler’s formula (graph formula)
● Chromatic number (color number)
![Page 40: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/40.jpg)
![Page 41: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/41.jpg)
Thanks for listening!! Questions??
![Page 42: Fun with Graph Theory · A Graph is a mathematical object consisting of Cities (Vertices) joined by Roads (straight edges). Our Rules: 1. Each road must connect exactly two cities](https://reader035.vdocuments.mx/reader035/viewer/2022081616/600673dde51c147e372024fd/html5/thumbnails/42.jpg)
Most of the material in this presentation comes from Joel David Hamkins:
-http://jdh.hamkins.org/math-for-eight-year-olds/-http://jdh.hamkins.org/math-for-seven-year-olds-graph-coloring-chromatic-numbers-eulerian-paths/