Königsberg Bridges.

Slides:



Advertisements
Similar presentations
The Chinese Postman Problem Route Planning Map Colouring
Advertisements

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.
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.
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.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
Topology YAN JIE (Ryan).
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Euler and Hamilton Paths
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
12.1 Exploring Solids Geometry Mrs. Spitz Spring 2006.
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.
Eulerian Circuits. A Warm Up Problem Jenny & John were at a Math Circles event with three other couples. As people arrived, various handshakes took place.
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.
Points, Lines, Planes, and Angles
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.
5-Minute Check Name the polygon by the number of sides.
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
Group 10 Project Part 3 Derrick Jasso Rodolfo Garcia Ivan Lopez M.
Euler and Hamilton Paths
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.6 Topology.
CSE 326: Data Structures NP Completeness Ben Lerner Summer 2007.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
CS 200 Algorithms and Data Structures
11.1 Space Figures and Cross Sections A polyhedron is a space figure, or three-dimensional figure, whose surfaces are polygons. Each polygon is a face.
Section 5.1 Rubber Sheet Geometry Discovering the Topological Idea of Equivalence by Distortion. “The whole of mathematics is nothing more than a refinement.
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
1. To make a Celtic knot, begin with a square or rectangle piece of paper and fold it into fourths.
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
DRILL How many sides does dodecagon have?
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
AND.
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
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
What is topology? The word topology comes from the Greek topos, "place," and logos, "study” Topology was known as geometria situs (Latin geometry of place)
Topology and The Euler Number
Analyzing Conic Sections
Euler and Hamiltonian Graphs
Data Structures Graphs - Terminology
OPERATIONS AND ALGBRAIC THINKING
Basic Vocabulary Student Friendly: I will be able to define an angle, circle, perpendicular lines, parallel lines, and line segments using the definition.
• • Graphing and Writing Equations of Ellipses
Can you draw this picture without lifting up your pen/pencil?
Euler Characteristics and Genus
12.1 Exploring Solids.
Euler Paths and Circuits
Graphs Chapter 13.
Excursions in Modern Mathematics Sixth Edition
Konigsberg- in days past.
FUNCTION NOTATION.
Graph Theory What is a graph?.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Analyzing Conic Sections
Section 14.1 Graphs, Paths, and Circuits
• • Graphing and Writing Equations of Ellipses
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Week 5: Polygons and Tilings on the SPhere
Presentation transcript:

Königsberg Bridges

Leonard Euler Study calculus Develop graph theory Major foci of Euler's work

15 April 1707 – 18 September 1783 Swiss mathematician and physicist. Discoveries Infinitesimal Calculus Graph Theory Introduced much of the modern mathematical terminology and notation for mathematical analysis , ex. expression of functions as sums of infinitely many terms Worked in mechanics, fluid dynamics, optics, and astronomy

Is it possible to draw a continuous curve that passes through each of the ten edges (line segments) exactly once? A curve that passes through a vertex is not allowed.

Create a graph with four vertices, one for each of the four regions including the outside region, D

Is it possible to draw a continuous curve that passes through each of the edges exactly once?

Graph Edge - a line is called an edge. Graph -the whole diagram is called a graph. Not this Degree - the number of edges that lead to a vertex is called the degree Vertex - a point is called a vertex (plural vertices) Edge - a line is called an edge. Simple Path - route around a graph that visits every vertex once Euler Path -route around a graph that visits every edge once

Graphs are among the most ubiquitous models of both natural and human-made structures. They can be used to model many types of relations and process dynamics in physical, biological and social systems. Many problems of practical interest can be represented by graphs.

Form a planar graph from a polyhedron place a light source near one face of the polyhedron, and a plane on the other side.

Euler’s Formula The function eix traces out the unit circle in the complex number plane as x ranges through the real numbers. x is the angle that a line connecting the origin with a point on the unit circle makes with the positive real axis, measured counter clockwise and in radians.

Three-dimensional visualization of Euler's formula in the complex plane

Internet

Airlines

Internet Routes Put to color 2005

Genetic composition of baker’s yeast You’re looking at the genetic composition of baker’s yeast, shown in full glory. It’s essentially a road map that shows how the cells are connected through nodes, similar to the image from last week that showed node connections on the Internet. “Genes typically do not function in isolation such that mutation in one gene will influence the activity of many other genes in a cell or organism,” says Michael Costanzo, PhD, a researcher at Terrence Donnelly Centre for Cellular and Biomolecular Research at the University of Toronto, speaking to FoxNews.com. “This is important to our understanding of disease since most genetic disorders are not caused by mutation of a single gene but rather by rare combinations of mutations in different genes. Thus, determining how genes interact with each other will help us understand the basis of genetic disease.”

Topology

Möbius Strip …have only one surface and one edge Type of object studied in topology

Paul Bunyan and the Hard Rock Mine Conveyor Belt Michigan is awash in Paul Bunyan tales of his logging exploits, but perhaps less well known are his ventures into mining and his extensive mathematical knowledge. While on his western tour, Paul developed a deep mine and was extracting high quality ore. Our story begins when the mine was a horizontal shaft about a quarter of a mile back into the mountains and had a fairly high volume of ore coming out the wind- and Babe (the blue ox)-powered main conveyor belt four feet wide. The mine branched at that point, but the best ore was found straight ahead and the mine shaft had developed such that a longer but narrower conveyor belt would increase efficiency. Specifically it was decided that a conveyor belt twice as long and half as wide as the original would be the best solution. Paul got out his sharp ax and proceeded to slice the conveyor belt down the middle. When he finished they installed the new converyor belt without having to cut it anymore or even splice it, much to everyone's surprise. Paul explained that he had put the half twist in it so it would wear evenly on both sides. A few years went by. Mining operations continued. Although the best ore vein curved slightly and narrowed down, they could still improve operations with a narrower, but longer conveyor. As Paul got out his new chain saw, he sent his trusty assistant to town to get a couple splicing kits. His assistant bulked having seen the results of the prior modification. He went anyway and was surprised when he came back to find the kits were not only needed, but the two resulting rings were linked together.

Trefoil knot

DNA Folding And Protein Folding

Sort the alphabet Homeomorphism classes are: one hole two tails, two holes no tail, no holes, one hole no tail, no holes three tails, a bar with four tails (the "bar" on the K is almost too short to see), one hole one tail, and no holes four tails. Homotopy classes are larger, because the tails can be squished down to a point. The homotopy classes are: one hole, two holes, and no holes.

Map of London

Shoreline Lake Of The Woods

A mathematician named Klein Thought the Möbius strip divine A mathematician named Klein Thought the Möbius strip divine. Said he, "If you glue The edges of two You'll get a bottle like mine."

Hamiltonian Circuit path that ends where it starts It visits each vertex once without touching any vertex more than once.

Cut a Mobius Strip in half Cut in half again

A mathematician confided That a Möbius strip is one-sided, And you'll get quite a laugh If you cut one in half, for it stays in one piece when divided.

Handcuffs What you need Partner Two pieces of rope Each piece of rope needs a slip knot at each end Put the handcuffs on as shown Separate the ropes without taking off the cuffs http://britton.disted.camosun.bc.ca/jbhandcuff.htm