Graph Theory Unit 2.

Slides:

Advertisements

Similar presentations

CSE 211 Discrete Mathematics

Advertisements

22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.

22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.

1 Chapter 15.3 Hamilton Paths and Hamilton Circuits Objectives 1.Understand the definitions of Hamilton paths & Hamilton circuits. 2.Find the number of.

Excursions in Modern Mathematics(Tannenbaum) and Thinking Mathematically (Blitzer)

Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.

Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.

A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting.

Traveling-Salesman Problems

Chapter 4 Graphs.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Slide 14-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.

Slide Copyright © 2009 Pearson Education, Inc. AND Active Learning Lecture Slides For use with Classroom Response Systems Chapter 14 Graph Theory.

Graph Theory Hamilton Paths and Hamilton Circuits.

5.7 Eulerizing Graphs. Euler circuit and Euler path do not always exist. There are many graphs (in real life) that have more than 2 odd vertices. Instead.

May 1, 2002Applied Discrete Mathematics Week 13: Graphs and Trees 1News CSEMS Scholarships for CS and Math students (US citizens only) $3,125 per year.

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.

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.

© 2010 Pearson Prentice Hall. All rights reserved. 1 §15.3, Hamilton Paths and Circuits.

Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.

1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.

6.1 Hamilton Circuits and Hamilton Path

CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.

Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.

Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.

1) Find and label the degree of each vertex in the graph.

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.

Today we will… Identify the vertices and edges on a given shape.

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,

Hamilton Paths and Hamilton Circuits

Excursions in Modern Mathematics Sixth Edition

Weighted Graphs and traveling Salesperson problem

EECS 203 Lecture 19 Graphs.

Shortest Path Problems

Traveling Salesman Problems

Graphs: Definitions and Basic Properties

Approximating Euler Paths

Agenda Lecture Content: Introduction to Graph Path and Cycle

2-5 Absolute Value Functions and Graphs

EECS 203 Lecture 20 More Graphs.

Chapter 2: Business Efficiency Lesson Plan

UNIT 1: EULER CIRCUITS GRAPH THEORY.

Discrete Maths 9. Graphs Objective

Chapter 2: Business Efficiency Lesson Plan

Section 14.3 Hamilton Paths, and Hamilton Circuits

Euler Paths and Circuits

Introduction to Graph Theory Euler and Hamilton Paths and Circuits

6.1 Hamilton Circuits and Hamilton Path

Louisiana Travels.

Walks, Paths, and Circuits

Graph Theory Unit 2.

Shortest Path Problems

A path that uses every vertex of the graph exactly once.

Warm Up – Wednesday.

ELECTRICAL CIRCUITS AND CONSTRUCTIONS An electrical circuit is a network consisting of a closed loop, giving a return path for the current 2.

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.

Discrete Mathematics Lecture 13_14: Graph Theory and Tree

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Euler and Hamilton Paths

Hamilton Paths and Hamilton Circuits

Hamilton Paths and Circuits

Traveling Salesman Problems Nearest Neighbor Method

Warm Up – 3/17 - Monday A) List the set of vertices.

Presentation transcript:

Graph Theory Unit 2

2.09 Path of Optimal Value

Definition On a graph, the Path of Minimum Value corresponds to the DISTANCE between two vertices The Path of Maximum Value corresponds to the simple path that travels the maximum amount of edges On a network, the Path of Optimal Value corresponds to the WEIGHT of the path between two vertices

Example 1: Find the Paths of Minimum value between A and P If there is an overwhelming number of ways to try, then you can use the strategy of labelling each vertex.

Example 2: Robert Bourassa Dam This facility generates approximately 5328MW of electricity, which is transmitted via high-tension lines to Quebec’s main urban centers. Transmission lines lose some power depending on state of repair and other factors. The engineering crew has to find the path of least power loss at any given time from the Dam to M.

Example 3:Outdoor Medicine A doctor must visit several villages in the Far North. He lives in village E and travels by snowmobile. The graph shows the villages he must visit. He usually spends 1 h in each village.

Questions Give a path that the doctor can follow to visit all of the villages without passing through the same village twice and without returning home after his trip

Questions Give a path that the doctor can take to visit every village without repeating and return home after. How long does this path take him?

Questions Why is it pointless to look for the leave value of an Euler path or circuit?

2.09 Practice Visions Book 2 Page 52 #4, 6, 8, 9, 10