Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Size: px
Start display at page:

Download "Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths"

Transcription

1 The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and ended at the same place and crossed every bridge exactly once. 1. If you were a resident of Königsberg, where would you start your walk and what path would you choose? 2. What about when you visit the Eastern and Western wildflower gardens that have fabulous sculptures in addition to beautiful flowers along the walkways. You want to see each display without backtracking (seeing something you have already seen). Where would you start your walk and what path would you choose? Western garden Eastern garden 1

2 When Leonhard Euler, a famous mathematician, turned his attention to the Bridge problem, his first step was to model the bridges of Königsberg with a simple graph. The points, or vertices, represented land and the edges represented the bridges connecting them. Euler s map of Königsberg, while much simpler, conveyed all the necessary information about which parts of land were connected by which bridges. It looked something like the following: The Bridge problem is now stated: Given a graph, find a path through the vertices (points) that uses every edge exactly once. Such a path is called a Euler path. If a Euler path begins and ends at the same vertex, it is called a Euler circuit. 2

3 3. For the following graphs, decide which have Euler circuits and which do not. Graph I Graph II Graph III Graph IV 4. The degree of a vertex is the number of edges that meet at the vertex. Determine the degree of each vertex in Graphs I IV. 5. For the graphs from Question 3 that have Euler circuits, how many vertices have an odd degree? 6. For the graphs from Question 3 that have Euler circuits, how many vertices have an even degree? 7. Form a conjecture about how you might quickly decide whether a graph has a Euler circuit, and explain why your conjecture seems reasonable. 3

4 8. What does your conjecture tell you about the Königsberg Bridge problem and the garden scenario? 9. Your friend Chet calls you on his cell phone and tells you that he has discovered a large rock embedded with gems! He is somewhere in your favorite hiking area, which has many interconnected paths, as shown below. Chet does not know exactly where he is, but he needs your help to carry the rock. To find him, you decide it would be most efficient to jog along all the paths in such a way that no path is covered twice. Find this efficient route on the map below or explain why no such route exists. 10. You have been hired to paint the yellow median stripe on the roads of a small town. Since you are being paid by the job and not by the hour, you want to find a path through the town that traverses each road only once. In the map of the town s roads below, find such a path or explain why no such path exists. 4

5 11. REFLECTION: For what situation(s) is it satisfactory to have only a path exist and not a circuit? 12. EXTENSION: Determine some other real-world problems whose solutions may involve finding Euler circuits or paths in graphs. There are a variety of road-traversing problems: delivering mail, garbage/recyclable collecting in a city, sweeping/cleaning streets, and so on. For each situation, describe what real-world complications exist that might make the problem more difficult. For example, when delivering mail, most streets have houses on either side of the street and the postal worker may decide to go up one side of the street and down the other. If the city has alleyways, perhaps the garbage collectors just need to travel down the alleys. Be prepared to make a short presentation of your findings to the class. 5

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and

More information

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet #

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet # AQR UNIT 7 NETWORKS AND GRAPHS: Circuits, Paths, and Graph Structures Packet # BY: Introduction to Networks and Graphs: Try drawing a path for a person to walk through each door exactly once without going

More information

Advanced Mathematical Decision Making

Advanced Mathematical Decision Making Advanced Mathematical Decision Making In Texas, also known as Advanced Quantitative Reasoning Unit VII: Networks and Graphs This course is a project of The Texas Association of Supervisors of Mathematics

More information

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010 Junior Circle Meeting 3 Circuits and Paths April 18, 2010 We have talked about insect worlds which consist of cities connected by tunnels. Here is an example of an insect world (Antland) which we saw last

More information

Launch problem: Lining streets

Launch problem: Lining streets Math 5340 June 15,2012 Dr. Cordero Launch problem: Lining streets Lining Street Problem A Problem on Eulerian Circuits http://www.edmath.org/mattours/discrete/ Your job for the day is to drive slowly around

More information

Introduction to Networks

Introduction to Networks LESSON 1 Introduction to Networks Exploratory Challenge 1 One classic math puzzle is the Seven Bridges of Königsberg problem which laid the foundation for networks and graph theory. In the 18th century

More information

Chapter 5: The Mathematics of Getting Around

Chapter 5: The Mathematics of Getting Around Euler Paths and Circuits Chapter 5: The Mathematics of Getting Around 5.1 Street-Routing Problem Our story begins in the 1700s in the medieval town of Königsberg, in Eastern Europe. At the time, Königsberg

More information

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits INB Table of Contents Date Topic Page # January 27, 2014 Test #1 14 January 27, 2014 Test # 1 Corrections 15 January 27, 2014 Section 14.1 Examples 16 January 27,

More information

Circuits and Paths. April 13, 2014

Circuits and Paths. April 13, 2014 Circuits and Paths April 13, 2014 Warm Up Problem Quandroland is an insect country that has four cities. Draw all possible ways tunnels can join the cities in Quadroland. (Remember that some cities might

More information

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits 14.2 Euler Paths and Euler Circuits The study of graph theory can be traced back to the eighteenth century when the people of the town of Konigsberg sought a solution to a popular problem. They had sections

More information

11-5 Networks. Königsberg Bridge Problem

11-5 Networks. Königsberg Bridge Problem Section 11-5 Networks 1 11-5 Networks In the 1700s, the people of Königsberg, Germany (now Kaliningrad in Russia), used to enjoy walking over the bridges of the Pregel River. There were three landmasses

More information

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits What You Will Learn Graphs Paths Circuits Bridges 14.1-2 Definitions A graph is a finite set of points called vertices (singular form is vertex) connected by line

More information

Worksheet 28: Wednesday November 18 Euler and Topology

Worksheet 28: Wednesday November 18 Euler and Topology Worksheet 28: Wednesday November 18 Euler and Topology The Konigsberg Problem: The Foundation of Topology The Konigsberg Bridge Problem is a very famous problem solved by Euler in 1735. The process he

More information

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around 1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************

More information

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around 1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************

More information

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study.

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. Graph Theory Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However, it wasn t studied too systematically until

More information

FINDING THE RIGHT PATH

FINDING THE RIGHT PATH Task 1: Seven Bridges of Konigsberg! Today we are going to begin with the story of Konigsberg in the 18 th century, its geography, bridges, and the question asked by its citizens. FINDING THE RIGHT PATH

More information

The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once?

The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once? The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once? Many people had tried the walk and felt that it was impossible, but no one knew for sure. In 1736, Leonard

More information

Street-Routing Problems

Street-Routing Problems Street-Routing Problems Lecture 26 Sections 5.1-5.2 Robb T. Koether Hampden-Sydney College Wed, Oct 25, 2017 Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, 2017 1 / 21 1

More information

Chapter 1. Urban Services. Chapter Outline. Chapter Summary

Chapter 1. Urban Services. Chapter Outline. Chapter Summary Chapter 1 Urban Services Chapter Outline Introduction Section 1.1 Euler Circuits Section 1.2 Finding Euler Circuits Section 1.3 Beyond Euler Circuits Section 1.4 Urban Graph Traversal Problems Chapter

More information

6.2. Paths and Cycles

6.2. Paths and Cycles 6.2. PATHS AND CYCLES 85 6.2. Paths and Cycles 6.2.1. Paths. A path from v 0 to v n of length n is a sequence of n+1 vertices (v k ) and n edges (e k ) of the form v 0, e 1, v 1, e 2, v 2,..., e n, v n,

More information

1. The Highway Inspector s Problem

1. The Highway Inspector s Problem MATH 100 Survey of Mathematics Fall 2009 1. The Highway Inspector s Problem The Königsberg Bridges over the river Pregel C c d e A g D a B b Figure 1. Bridges f Is there a path that crosses every bridge

More information

of Nebraska - Lincoln

of Nebraska - Lincoln University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2008 De Bruijn Cycles Val Adams University of Nebraska

More information

Travel Every Edge 3. Example (Travel Every Edge 3) In the graphs above, can you find a circuit that hits every edge without repeating any edges?

Travel Every Edge 3. Example (Travel Every Edge 3) In the graphs above, can you find a circuit that hits every edge without repeating any edges? Travel Every Edge 3 Example (Travel Every Edge 3) In the graphs above, can you find a circuit that hits every edge without repeating any edges? Find the degrees of the vertices of the graphs above! Make

More information

08. First and second degree equations

08. First and second degree equations 08. First and second degree equations GRAPH THEORY Based on Chris K. Caldwell work: http://primes.utm.edu/cgi-bin/caldwell/tutor/graph/index.html INTRODUCTION Consider the next problem: Old Königsberg

More information

Mohammad A. Yazdani, Ph.D. Abstract

Mohammad A. Yazdani, Ph.D. Abstract Utilizing Euler s Approach in Solving Konigsberg Bridge Problem to Identify Similar Traversable Networks in a Dynamic Geometry Teacher Education Environment: An Instructional Activity Mohammad A. Yazdani,

More information

1 Euler Circuits. Many of the things we do in daily life involve networks, like the one shown below [Houston Street Map]. Figure 1: Houston City Map

1 Euler Circuits. Many of the things we do in daily life involve networks, like the one shown below [Houston Street Map]. Figure 1: Houston City Map 1 Euler Circuits Many of the things we do in daily life involve networks, like the one shown below [Houston Street Map]. Figure 1: Houston City Map Suppose you needed to vist a number of locations in the

More information

How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?

How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities? 1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this

More information

Graph Theory

Graph Theory Graph Theory 2012.04.18 Our goal today is to learn some basic concepts in graph theory and explore fun problems using graph theory. A graph is a mathematical object that captures the notion of connection.

More information

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/z

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ -  artale/z CHAPTER 10 GRAPHS AND TREES Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/z SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions

More information

Pre-Calculus. Slide 1 / 192. Slide 2 / 192. Slide 3 / 192. Matrices

Pre-Calculus. Slide 1 / 192. Slide 2 / 192. Slide 3 / 192. Matrices Slide 1 / 192 Pre-Calculus Slide 2 / 192 Matrices 2015-03-23 www.njctl.org Table of Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving

More information

Pre-Calculus Matrices

Pre-Calculus Matrices Slide 1 / 192 Slide 2 / 192 Pre-Calculus Matrices 2015-03-23 www.njctl.org Slide 3 / 192 Table of Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication

More information

#30: Graph theory May 25, 2009

#30: Graph theory May 25, 2009 #30: Graph theory May 25, 2009 Graph theory is the study of graphs. But not the kind of graphs you are used to, like a graph of y = x 2 graph theory graphs are completely different from graphs of functions.

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.

More information

Pre-Calculus. Introduction to Matrices. Slide 1 / 192 Slide 2 / 192. Slide 3 / 192. Slide 4 / 192. Slide 6 / 192. Slide 5 / 192. Matrices

Pre-Calculus. Introduction to Matrices. Slide 1 / 192 Slide 2 / 192. Slide 3 / 192. Slide 4 / 192. Slide 6 / 192. Slide 5 / 192. Matrices Slide 1 / 192 Slide 2 / 192 Pre-Calculus Matrices 2015-03-23 www.njctl.org Slide 3 / 192 Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving

More information

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Test Review Ch 4 Name SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Solve the problem. 1) According to the 2000 U. S. Census, 6.753% of the U.S. population

More information

EECS 203 Lecture 20. More Graphs

EECS 203 Lecture 20. More Graphs EECS 203 Lecture 20 More Graphs Admin stuffs Last homework due today Office hour changes starting Friday (also in Piazza) Friday 6/17: 2-5 Mark in his office. Sunday 6/19: 2-5 Jasmine in the UGLI. Monday

More information

MATH 113 Section 9.2: Topology

MATH 113 Section 9.2: Topology MATH 113 Section 9.2: Topology Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2007 Outline 1 Introduction to Topology 2 Topology and Childrens Drawings 3 Networks 4 Conclusion Geometric Topology

More information

Vertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University

Vertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University Vertex-Edge Graphs Vertex-Edge Graphs In the Georgia Performance Standards Sarah Holliday Southern Polytechnic State University Math III MM3A7. Students will understand and apply matrix representations

More information

Ma/CS 6a Class 8: Eulerian Cycles

Ma/CS 6a Class 8: Eulerian Cycles Ma/CS 6a Class 8: Eulerian Cycles By Adam Sheffer The Bridges of Königsberg Can we travel the city while crossing every bridge exactly once? 1 How Graph Theory was Born Leonhard Euler 1736 Eulerian Cycle

More information

Grades 7 & 8, Math Circles 31 October/1/2 November, Graph Theory

Grades 7 & 8, Math Circles 31 October/1/2 November, Graph Theory Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grades 7 & 8, Math Circles 31 October/1/2 November, 2017 Graph Theory Introduction Graph Theory is the

More information

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.

More information

Displaying Data with Graphs. Chapter 6 Mathematics of Data Management (Nelson) MDM 4U

Displaying Data with Graphs. Chapter 6 Mathematics of Data Management (Nelson) MDM 4U Displaying Data with Graphs Chapter 6 Mathematics of Data Management (Nelson) MDM 4U Cause and Effect Diagrams Developed by Dr. Kaoru Ishikawa in 1943 (Japan) Picture composed of lines and symbols designed

More information

Sections 5.2, 5.3. & 5.4

Sections 5.2, 5.3. & 5.4 MATH 11008: Graph Theory Terminology Sections 5.2, 5.3. & 5.4 Routing problem: A routing problem is concerned with finding ways to route the delivery of good and/or services to an assortment of destinations.

More information

An Interactive Introduction to Graph Theory

An Interactive Introduction to Graph Theory An Interactive Introduction to Graph Theory An Interactive Introduction to Graph Theory Chris K. Caldwell 1995 This the first of a series of interactive tutorials introducing the basic concepts of graph

More information

CHAPTER 10 GRAPHS AND TREES. Copyright Cengage Learning. All rights reserved.

CHAPTER 10 GRAPHS AND TREES. Copyright Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES Copyright Cengage Learning. All rights reserved. SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions and

More information

New Jersey Center for Teaching and Learning. Progressive Mathematics Initiative

New Jersey Center for Teaching and Learning. Progressive Mathematics Initiative Slide 1 / 192 New Jersey Center for Teaching and Learning Progressive Mathematics Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students

More information

GRAPH THEORY AND COMBINATORICS ( Common to CSE and ISE ) UNIT 1

GRAPH THEORY AND COMBINATORICS ( Common to CSE and ISE ) UNIT 1 GRAPH THEORY AND COMBINATORICS ( Common to CSE and ISE ) Sub code : 06CS42 UNIT 1 Introduction to Graph Theory : Definition and Examples Subgraphs Complements, and Graph Isomorphism Vertex Degree, Euler

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.

More information

Chapter 14 Section 3 - Slide 1

Chapter 14 Section 3 - Slide 1 AND Chapter 14 Section 3 - Slide 1 Chapter 14 Graph Theory Chapter 14 Section 3 - Slide WHAT YOU WILL LEARN Graphs, paths and circuits The Königsberg bridge problem Euler paths and Euler circuits Hamilton

More information

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC   January 26, 2011 Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly

More information

Classic Graph Theory Problems

Classic Graph Theory Problems Classic Graph Theory Problems Hiroki Sayama sayama@binghamton.edu The Origin Königsberg bridge problem Pregel River (Solved negatively by Euler in 176) Representation in a graph Can all the seven edges

More information

Graph Theory Problems Instructor: Natalya St. Clair. 1 The Seven Bridges of Königsberg Problem

Graph Theory Problems Instructor: Natalya St. Clair. 1 The Seven Bridges of Königsberg Problem Graph Theory Problems erkeley Math ircles 2015 Lecture Notes Graph Theory Problems Instructor: Natalya St. lair 1 The Seven ridges of Königsberg Problem Königsberg is an ancient city of Prussia, now Kalingrad,

More information

Graphs. Reading Assignment. Mandatory: Chapter 3 Sections 3.1 & 3.2. Peeking into Computer Science. Jalal Kawash 2010

Graphs. Reading Assignment. Mandatory: Chapter 3 Sections 3.1 & 3.2. Peeking into Computer Science. Jalal Kawash 2010 Graphs Mandatory: hapter 3 Sections 3.1 & 3.2 Reading ssignment 2 Graphs bstraction of ata 3 t the end of this section, you will be able to: 1.efine directed and undirected graphs 2.Use graphs to model

More information

Majority and Friendship Paradoxes

Majority and Friendship Paradoxes Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the

More information

Beyond the Euler Trail. Mathematics is often thought of as formulas, ratios, and the number Pi. The history of

Beyond the Euler Trail. Mathematics is often thought of as formulas, ratios, and the number Pi. The history of Patino 1 Prof. Petersen Sierra Patino Math 101 Section 4939 6 April 2016 Beyond the Euler Trail Mathematics is often thought of as formulas, ratios, and the number Pi. The history of math and its roots

More information

Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III

Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III 1 Eulerian Graphs Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III Let s begin this section with a problem that you may remember from lecture 1. Consider the layout of land and water

More information

Sarah Will Math 490 December 2, 2009

Sarah Will Math 490 December 2, 2009 Sarah Will Math 490 December 2, 2009 Euler Circuits INTRODUCTION Euler wrote the first paper on graph theory. It was a study and proof that it was impossible to cross the seven bridges of Königsberg once

More information

Discrete Mathematics and Probability Theory Spring 2015 Vazirani Note 5

Discrete Mathematics and Probability Theory Spring 2015 Vazirani Note 5 CS 70 Discrete Mathematics and Probability Theory Spring 2015 Vazirani Note 5 1 Graph Theory: An Introduction One of the fundamental ideas in computer science is the notion of abstraction: capturing the

More information

Graph Theory. 26 March Graph Theory 26 March /29

Graph Theory. 26 March Graph Theory 26 March /29 Graph Theory 26 March 2012 Graph Theory 26 March 2012 1/29 Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However,

More information

Undirected Network Summary

Undirected Network Summary Undirected Network Summary Notice that the network above has multiple edges joining nodes a to d and the network has a loop at node d. Also c is called an isolated node as it is not connected to any other

More information

Paths, Circuits, and Connected Graphs

Paths, Circuits, and Connected Graphs Paths, Circuits, and Connected Graphs Paths and Circuits Definition: Let G = (V, E) be an undirected graph, vertices u, v V A path of length n from u to v is a sequence of edges e i = {u i 1, u i} E for

More information

3 Euler Tours, Hamilton Cycles, and Their Applications

3 Euler Tours, Hamilton Cycles, and Their Applications 3 Euler Tours, Hamilton Cycles, and Their Applications 3.1 Euler Tours and Applications 3.1.1 Euler tours Carefully review the definition of (closed) walks, trails, and paths from Section 1... Definition

More information

Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006

Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006 Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006 THE KIT: This kit contains materials for two Instant Insanity games, a student activity sheet with answer key and this instructor

More information

Eulerian Cycle (2A) Young Won Lim 4/26/18

Eulerian Cycle (2A) Young Won Lim 4/26/18 Eulerian Cycle (2A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 The Seven Bridges of Königsberg In

More information

Graphs And Algorithms

Graphs And Algorithms Graphs nd lgorithms Mandatory: hapter 3 Sections 3.1 & 3.2 Reading ssignment 2 1 Graphs bstraction of ata 3 t the end of this section, you will be able to: 1. efine directed and undirected graphs 2. Use

More information

The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10.

The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10. Section 3.1 The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10. Value Symbol Represents 1 Staff 10 Heel bone 100 Coil of rope 1,000 Lotus flower 10,000

More information

Euler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas

Euler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas 1 Paths and the adjacency matrix The powers of the adjacency matrix A r (with normal, not boolean multiplication) contain the number

More information

GRAPH THEORY AND LOGISTICS

GRAPH THEORY AND LOGISTICS GRAPH THEORY AND LOGISTICS Maja Fošner and Tomaž Kramberger University of Maribor Faculty of Logistics Mariborska cesta 2 3000 Celje Slovenia maja.fosner@uni-mb.si tomaz.kramberger@uni-mb.si Abstract This

More information

MATH 101: Introduction to Contemporary Mathematics

MATH 101: Introduction to Contemporary Mathematics MATH 101: Introduction to Contemporary Mathematics Sections 201-206 Instructor: H. R. Hughes Course web page: http://www.math.siu.edu/hughes/math101.htm Summer 2013 Lecture sessions meet: MTWF 12:10-1:10

More information

Digital Integrated CircuitDesign

Digital Integrated CircuitDesign Digital Integrated CircuitDesign Lecture 8 Design Rules Adib Abrishamifar EE Department IUST Contents Design Rules CMOS Process Layers Intra-Layer Design Rules Via s and Contacts Select Layer Example Cell

More information

MA/CS 109 Lecture 2. The Konigsberg Bridge Problem And Its generalizabons

MA/CS 109 Lecture 2. The Konigsberg Bridge Problem And Its generalizabons MA/CS 109 Lecture 2 The Konigsberg Bridge Problem And Its generalizabons All Course informabon at hdp://www.cs.bu.edu/fac/snyder/cs109/ Remark: This page will be conbnually updated. First Homework to be

More information

INTRODUCTION TO GRAPH THEORY. 1. Definitions

INTRODUCTION TO GRAPH THEORY. 1. Definitions INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with

More information

Varying Applications (examples)

Varying Applications (examples) Graph Theory Varying Applications (examples) Computer networks Distinguish between two chemical compounds with the same molecular formula but different structures Solve shortest path problems between cities

More information

Graph Theory CS/Math231 Discrete Mathematics Spring2015

Graph Theory CS/Math231 Discrete Mathematics Spring2015 1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices

More information

The Human Brain & Graph Theory

The Human Brain & Graph Theory The Human Brain & Graph Theory Graph Theory A graph is a collection of vertices (or points) that are connected by edges (or lines) Edges may overlap Graphs do not need edges Graphs can be directed with

More information

Understand graph terminology Implement graphs using

Understand graph terminology Implement graphs using raphs Understand graph terminology Implement graphs using djacency lists and djacency matrices Perform graph searches Depth first search Breadth first search Perform shortest-path algorithms Disjkstra

More information

Precept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011

Precept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011 Precept 4: Traveling Salesman Problem, Hierarchical Clustering Qian Zhu 2/23/2011 Agenda Assignment: Traveling salesman problem Hierarchical clustering Example Comparisons with K-means TSP TSP: Given the

More information

Week 10: Colouring graphs, and Euler s paths. 14 and 16 November, 2018

Week 10: Colouring graphs, and Euler s paths. 14 and 16 November, 2018 MA284 : Discrete Mathematics Week 10: Colouring graphs, and Euler s paths http://www.maths.nuigalway.ie/ niall/ma284/ 14 and 16 November, 2018 1 Colouring The Four Colour Theorem 2 Graph colouring Chromatic

More information

11.2 Eulerian Trails

11.2 Eulerian Trails 11.2 Eulerian Trails K.. onigsberg, 1736 Graph Representation A B C D Do You Remember... Definition A u v trail is a u v walk where no edge is repeated. Do You Remember... Definition A u v trail is a u

More information

MA 111 Review for Exam 3

MA 111 Review for Exam 3 MA 111 Review for Exam 3 Exam 3 (given in class on Tuesday, March 27, 2012) will cover Chapter 5. You should: know what a graph is and how to use graphs to model geographic relationships. know how to describe

More information

Math for Liberal Arts MAT 110: Chapter 13 Notes

Math for Liberal Arts MAT 110: Chapter 13 Notes Math for Liberal Arts MAT 110: Chapter 13 Notes Graph Theory David J. Gisch Networks and Euler Circuits Network Representation Network: A collection of points or objects that are interconnected in some

More information

Grade 7/8 Math Circles March 7, 2012 Introduction to Graph Theory

Grade 7/8 Math Circles March 7, 2012 Introduction to Graph Theory 1 University of Waterloo Faculty of Mathematics entre for Education in Mathematics and omputing Grade 7/8 Math ircles March 7, 2012 Introduction to Graph Theory What is graph theory? Graph theory is the

More information

Salvador Sanabria History of Mathematics. Königsberg Bridge Problem

Salvador Sanabria History of Mathematics. Königsberg Bridge Problem Salvador Sanabria History of Mathematics Königsberg Bridge Problem The Problem of the Königsberg Bridge There is a famous story from Konigsberg. The city of Konigsberg, Northern Germany has a significant

More information

Two vertices that are joined by an edge are said to be adjacent. They are also called neighbours.

Two vertices that are joined by an edge are said to be adjacent. They are also called neighbours. Graph Theory Here is a detailed and topographically accurate map of the city of Konigsberg (now called Kaliningrad) as it was in the year 1736. As you can see, the river Pregel runs through the middle

More information

Section 3.4 Basic Results of Graph Theory

Section 3.4 Basic Results of Graph Theory 1 Basic Results of Graph Theory Section 3.4 Basic Results of Graph Theory Purpose of Section: To formally introduce the symmetric relation of a (undirected) graph. We introduce such topics as Euler Tours,

More information

Fleury s Algorithm The Adjacency Matrix and Distances Is There a Path From A to B? What is the Path from A to B? Is There a Path From ANY A to ANY B?

Fleury s Algorithm The Adjacency Matrix and Distances Is There a Path From A to B? What is the Path from A to B? Is There a Path From ANY A to ANY B? Intro Math Problem Solving 3 Graph TheoryNovember Origin Fleury s Algorithm The Adjacency Matrix and Distances Is There a Path From A to B? What is the Path from A to B? Is There a Path From ANY A to ANY

More information

8. The Postman Problems

8. The Postman Problems 8. The Postman Problems The Chinese postman problem (CPP) A postal carrier must pick up the mail at the post office, deliver the mail along blocks on the route, and finally return to the post office. To

More information

Chapter 8 Topics in Graph Theory

Chapter 8 Topics in Graph Theory Chapter 8 Topics in Graph Theory Chapter 8: Topics in Graph Theory Section 8.1: Examples {1,2,3} Section 8.2: Examples {1,2,4} Section 8.3: Examples {1} 8.1 Graphs Graph A graph G consists of a finite

More information

Graph Traversals. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari 1

Graph Traversals. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari 1 Graph Traversals CSC 1300 Discrete Structures Villanova University Villanova CSC 1300 - Dr Papalaskari 1 Graph traversals: Euler circuit/path Major Themes Every edge exactly once Hamilton circuit/path

More information

EULERIAN GRAPHS AND ITS APPLICATIONS

EULERIAN GRAPHS AND ITS APPLICATIONS EULERIAN GRAPHS AND ITS APPLICATIONS Aruna R 1, Madhu N.R 2 & Shashidhar S.N 3 1.2&3 Assistant Professor, Department of Mathematics. R.L.Jalappa Institute of Technology, Doddaballapur, B lore Rural Dist

More information

Discrete mathematics

Discrete mathematics Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many

More information

Chapter 3: Paths and Cycles

Chapter 3: Paths and Cycles Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk

More information

Graphs: Definitions Trails, Paths, and Circuits Matrix Representations Isomorphisms. 11. Graphs and Trees 1. Aaron Tan. 30 October 3 November 2017

Graphs: Definitions Trails, Paths, and Circuits Matrix Representations Isomorphisms. 11. Graphs and Trees 1. Aaron Tan. 30 October 3 November 2017 11. Graphs and Trees 1 Aaron Tan 30 October 3 November 2017 1 The origins of graph theory are humble, even frivolous. Whereas many branches of mathematics were motivated by fundamental problems of calculation,

More information

Graph Theory. Part of Texas Counties.

Graph Theory. Part of Texas Counties. Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.

More information

Graph Theory. Defining a Graph

Graph Theory. Defining a Graph Graph Theory This topic is one of the most applicable to real-life applications because all networks (computer, transportation, communication, organizational, etc.) can be represented with a graph. For

More information

Math 110 Graph Theory II: Circuits and Paths

Math 110 Graph Theory II: Circuits and Paths Math 110 Graph Theory II: Circuits and Paths For Next Time. Read Section 6.1 Circuit Training (p. 386ff) for more background on this material. Review the definition of a graph. Make sure you understand

More information

Introduction III. Graphs. Motivations I. Introduction IV

Introduction III. Graphs. Motivations I. Introduction IV Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg

More information

Graph Theory Lecture 5: Modeling with Graphs, and Euler Circuits/Paths Spring 2014 Morgan Schreffler Office: POT 902

Graph Theory Lecture 5: Modeling with Graphs, and Euler Circuits/Paths Spring 2014 Morgan Schreffler Office: POT 902 Graph Theory Lecture 5: Modeling with Graphs, and Euler Circuits/Paths Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Modeling With Graphs (General Tips) We like to make

More information