Math III Warm Up9/4/13. What is the multiplicative identity of a 3x3 matrix? The additive identity?

Slides:



Advertisements
Similar presentations
Vertex-Edge Graphs.
Advertisements

Minimal Spanning Trees – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Minimal Spanning Trees Reading: Kolman, Section 7.5.
Graphs CS-240/341. Uses for Graphs computer networks and routing airline flights geographic maps course prerequisite structures tasks for completing a.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Wednesday, 9/26/01 Graph Basics.
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
Introduction to Graph  A graph consists of a set of vertices, and a set of edges that link together the vertices.  A graph can be: Directed: Edges are.
Karsten Steinhaeuser Aaron Wenger December 09, 2003.
 Consider the cities Atlanta, Boston, Chicago, Detroit, Fargo, and Los Angeles.  We want to see what connections there are between cities on a particular.
Chapter 9: Graphs Basic Concepts
9.3 Representing Graphs and Graph Isomorphism
Graphs CS /02/05 Graphs Slide 2 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved Definition.
GRAPH THEORY.  A graph is a collection of vertices and edges.  An edge is a connection between two vertices (or nodes).  One can draw a graph by marking.
CS261 – Data Structures Graphs. Goals Introduction and Motivation Representations.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
UNIT 3 THINKING MATHEMATICALLY BY BLITZER Hamilton Paths and Hamilton Circuits.
Spring 2007Graphs1 ORD DFW SFO LAX
5.4 Graph Models (part I – simple graphs). Graph is the tool for describing real-life situation. The process of using mathematical concept to solve real-life.
1.1 – 1.2 Sets of Numbers & Properties of Real Numbers 8/21/13 Algebra ¾ Mr. Smits Goals: Classify and order real numbers. Identify & use properties of.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
COSC 2007 Data Structures II Chapter 14 Graphs I.
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Data Structures CSCI 132, Spring 2014 Lecture 38 Graphs
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
Math III Warm Up 3/25/13 Sketch the following on the parabola below. (draw just as it is) - Vertex, focus, directrix, lattice points.
Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:
Graphs. Contents Terminology Graphs as ADTs Applications of Graphs.
Graphs Chapter 28 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. Data Structures and Abstractions with Java, 4e Frank Carrano.
Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.
Introduction to NP Instructor: Neelima Gupta 1.
MATRICES. DEFINITION A rectangular array of numeric or algebraic quantities subject to mathematical operations. Something resembling such an array, as.
CSC 252 Pallavi Moorthy Homework 5. 1.) Vertices, edges From cd../../handout/demo/graph_alg/gw_shortest_path.
Graphs ORD SFO LAX DFW Graphs 1 Graphs Graphs
Graphs Chapter 20.
Matrix Representation of Graphs
Basic Concepts Graphs For more notes and topics visit:
Minimum Spanning Tree Chapter 13.6.
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Graphs Slides are adopted from “Discrete.
Graphs and Graph Models
Matrices.
abstract containers sequence/linear (1 to 1) hierarchical (1 to many)
Euler Paths and Circuits
Graphs Chapter 13.
abstract containers sequence/linear (1 to 1) hierarchical (1 to many)
Chapter 9: Graphs Basic Concepts
Connectivity Section 10.4.
Walks, Paths, and Circuits
Yan Shi CS/SE 2630 Lecture Notes
Graph Theory By Amy C. and John M..
Trees L Al-zaid Math1101.
Graphs.
10.1 Graphs and Graph Models
Functions Guided Notes Review
Cornell Notes: Euler Paths and Circuits
Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.
Chapter 14 Graphs © 2006 Pearson Addison-Wesley. All rights reserved.
Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.
Graphs.
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
abstract containers sequence/linear (1 to 1) hierarchical (1 to many)
Warm Up – 3/17 - Monday A) List the set of vertices.
Graph Vocabulary.
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Where’s Poly.
Algorithms CSCI 235, Spring 2019 Lecture 32 Graphs I
Chapter 9: Graphs Basic Concepts
GRAPHS.
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

Math III Warm Up9/4/13

What is the multiplicative identity of a 3x3 matrix? The additive identity?

A collection of points and line segments connecting some (possibly empty) subsets of the points Vertex Edge AB C D F

Goal: Use vertex-edge graphs to represent real-life situations Transportation:

Goal: Use vertex-edge graphs to represent real-life situations Example 1 An airline serves four cities: Bedford, Columbia, Dunwich, and Exton. There are flights between Bedford and Columbia, Bedford and Dunwich, and Columbia and Exton. Draw a simple undirected vertex-edge graph to represent this situation. STEP ONE: REPRESENT STEP TWO: DRAW

Goal: Use vertex-edge graphs to represent real-life situations Example 2 An airline serves five cities: Lowell, Montour, Atlanta, Orlando, and Peoria. There are flights between Lowell and Montour, Lowell and Orlando, Montour and Orlando, Atlanta and Orlando, and Atlanta and Peoria. Draw a simple undirected vertex-edge graph to represent this situation.

Goal: Use vertex-edge graphs to represent real-life situations

CONNECTION ALERT! Example 3 Use a MATRIX to represent the vertex edge graph from example 1.

By taking the square of the matrix, you can find out the number of 2 route possibilities between 2 cities.