Warm up 10-22-2010 1. Mr. Euler and Mr. Hamilton sit down one day to invent a game. They call their new game “baseball.” They argued about whether it was.

Slides:



Advertisements
Similar presentations
Graph-02.
Advertisements

Hamiltonian Circuits and Paths
B cd a e f g h i j k One answer is; a-g-c-b-f-e-i-k-h-d-j-a Year 2 Warm Up 10/21/10 State a Hamilton Circuit for the following figure:
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
AMDM UNIT 7: Networks and Graphs
Going Places Safely Essential Question:
1 Chapter 15.3 Hamilton Paths and Hamilton Circuits Objectives 1.Understand the definitions of Hamilton paths & Hamilton circuits. 2.Find the number of.
Graphs. Overview What is a graph? Some terminology Types of graph Implementing graphs (briefly) Some graph algorithms Graphs 2/18.
What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
§ Hamiltonian Circuits and Paths; Complete Graphs A sample-return mission sent to discover signs of microbial life on Mars is scheduled to be launched.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
Multiplying matrices An animated example. (3 x 3)x (3 x 2)= (3 x 2) These must be the same, otherwise multiplication cannot be done Is multiplication.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Can you find a way to cross every bridge only once?
CSNB143 – Discrete Structure Topic 9 – Graph. Learning Outcomes Student should be able to identify graphs and its components. Students should know how.
Warm Up. Multiplying Matrices 6.2 part 2 **Multiply rows times columns. **You can only multiply if the number of columns in the 1 st matrix is equal.
Page 714 #1-10 ANSWERS Lesson Reflection for Chapter 14 Section 7.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
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.
Directed Graphs AZ Standard Use directed graphs to solve problems.
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.
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:
1) Find and label the degree of each vertex in the graph.
3.6 Multiplying Matrices Homework 3-17odd and odd.
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.
Classwork Quiz Worksheet Homework (day 54) Worksheet (1-7) Walks, Paths and Circuits SOL: DM.1.
Welcome! Cinda Heeren Lecturer Department of CS UIUC The Beauty of Computer Science.
MATRICES. DEFINITION A rectangular array of numeric or algebraic quantities subject to mathematical operations. Something resembling such an array, as.
(CSC 102) Lecture 30 Discrete Structures. Graphs.
Modeling the Game of Brain Cube Leslie Muzulu, Kristal Jameson, and Kathy Radloff; St. Catherine University Game Description Brain Cube is a puzzle game.
© 2006 Pearson Addison-Wesley. All rights reserved14 B-1 Chapter 14 (continued) Graphs.
Hex: a Game of Connecting Faces. Player 1 Player 2 Players take turns placing blue chips (player 1) and red chips (player 2). Player 1 plays first. Player.
Hamiltonian Circuits and Paths
Excursions in Modern Mathematics Sixth Edition
Multiplying Matrices.
CSNB 143 Discrete Mathematical Structures
15. Directed graphs and networks
Task Tables Draw a graph for the following task table.
Discrete Structures – CNS2300
Matrix Representation of Graph
Planar Graphs & Euler’s Formula
Warm Up Use scalar multiplication to evaluate the following:
Multiplying Matrices.
Can you draw this picture without lifting up your pen/pencil?
Chapter 4 Review Math Analysis
Euler Paths and Circuits
! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!
Pathways and Pascal's Triangle.
Lecture 15: Graph Theory II
Walks, Paths, and Circuits
Matrix Multiplication
A path that uses every vertex of the graph exactly once.
Konigsberg- in days past.
Warm Up – Wednesday.
Hamiltonian Circuits and Paths
Cornell Notes: Euler Paths and Circuits
Multiplying Matrices.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Hamilton Paths and Circuits
Graph Vocabulary.
Multiplying Matrices.
Multiplying Matrices.
Multiplying Matrices.
Presentation transcript:

Warm up Mr. Euler and Mr. Hamilton sit down one day to invent a game. They call their new game “baseball.” They argued about whether it was more important to run on the base paths or to touch the actual bases. Who ended up winning the argument? 2. A “circuit board” is an electronic piece of equipment involved in all kinds of technology. The electricity that passes through a circuit board starts at the power source and travels through the circuit back to the power source. How come we don’t call it a “path board?”

Vertex Edge Graphs Day 3: Adjacency Matrices An adjacency matrix is a ___________ way of displaying the data shown in a ____________. Graphical Vertex Edge Graph

Consider the following social network below. What could it represent? ____________________________ Alex Debra J.C. Justin Steph Lisa Phone Calls, Texts, letters, s, Facebook posts, conversations, etc.

What do the arrows represent in this vertex edge graph? ________________ And arrow towards a person means what? ________________ An arrow away from a person means what? ________________ An arrow on both ends means what? ________________ Some type of connection or contact. They received a communication. They sent a communication. They both received and sent a communication.

Vertex Edge Graph vs. Adjacency Matrix The vertex edge graph is convenient to use when comparing two pieces of information. An adjacency matrix is more useful when comparing all the information or when comparing several parts at once.

First you must define your values: ► 1 in a row means ______________________________________ ► 0 in a row means ______________________________________ ► 1 in a column means ______________________________________ ► 0 in a column means ______________________________________ A connection was made/sent to the person in the column No connection was made/sent to that person. That person received a communication. No communication was received.

Now fill in your Adjacency Matrix LisaStephJustinJ.C.DebraAlex Total Total Lisa Steph Justin J.C Debra Alex Total What do these totals tell us? The totals of the rows are the number of messages sent. The totals of the columns are the number of messages received.

Answer the following questions. Answers will vary. ► Who is the most “outgoing” or “outspoken/written?” _____________________________ ► Who is the “most popular?” _____________________________ ► Who is the “least popular?” _____________________________ ► Who is the most “introverted?” ______________________________

Example 2 Given this tournament graph, make an adjacency matrix to determine 1 st, 2 nd, 3 rd, and 4 th place. CalTresJustinAlTotalCal00101 Tres10102 Justin00000 Al11103 Al took 1 st, Tres was 2 nd, Cal was 3 rd, and Justin was 4 th.

Example 3 Given this tournament graph, made an adjacency matrix to determine 1 st, 2 nd, 3 rd, and 4 th place. BoKatJustinDanTotalBo00101 Kat10012 Justin01001 Dan10102 This one is a little different, we don’t know the clear winner without thinking a bit. You can still make your matrix and find the row sums.

► The row sums tells us we can have ______ winners, they are _________ or _________. ► Now we need to list the Hamilton Paths (there are five) ► ___________, _________ and ________ ► Which one matches the matrix the best? Why ? BoKatJustinDanTotal Bo00101 Kat10012 Justin01001 Dan Kat Dan BJKD DJKB KDBJ According to our matrix, Bo and Justin have to finish 3 rd and 4 th while Kat and Dan have to finish 1 st and 2 nd. KDBJ most closely matches that situation.

Summary: An adjacency matrix is used to… Homework: Adjacency Matrix w/s