Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:

Slides:



Advertisements
Similar presentations
Vertex-Edge Graphs.
Advertisements

8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.
Essential Question: How do we use matrices to solve problems? How do we relate matrices to vertex-edge graphs? Standards: MM3A7: Students will understand.
Math III NEW SEATS!!! Sept. 3, 2013.
12-1 Representations of Three-Dimensional Figures
Euler Circuits and Paths
Decision Maths Graphs Wiltshire Graphs A graph is just a diagram made up of “dots” and “lines”. These are all graphs. The dots are called “nodes” or.
Graphs CS-240/341. Graphs Used for representing many-to-many relationships –can take two forms directed (digraph) - a finite set of elements called vertices.
CS 206 Introduction to Computer Science II 11 / 03 / 2008 Instructor: Michael Eckmann.
9.3 Representing Graphs and Graph Isomorphism
Graphs, relations and matrices
Applied Discrete Mathematics Week 10: Equivalence Relations
Unit 4 Lesson 1 CLASSIFYING TRIANGLES.  I will be able to classify triangles according to the angle measures and side lengths.  I WILL be able to define.
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.
Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.
(CSC 102) Lecture 28 Discrete Structures. Graphs.
Math III Warm Up9/4/13. What is the multiplicative identity of a 3x3 matrix? The additive identity?
Graph Theory Introducton.
Vocabulary and Representations of Graphs. NC Standard Course of Study Competency Goal 1: The learner will use matrices and graphs to model relationships.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
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.
Graph Theory Introducton.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
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.
Graphs Basic properties.
1) Find and label the degree of each vertex in the graph.
Hamilton Paths and Circuits 1 Click to Start 2 3 Start End.
Classwork Quiz Worksheet Homework (day 54) Worksheet (1-7) Walks, Paths and Circuits SOL: DM.1.
Today we will… Identify the vertices and edges on a given shape.
Notes Over 4.2 Finding the Product of Two Matrices Find the product. If it is not defined, state the reason. To multiply matrices, the number of columns.
MATRICES. DEFINITION A rectangular array of numeric or algebraic quantities subject to mathematical operations. Something resembling such an array, as.
Math 10 N & M Unit Lesson (2) Digraphs and Matrices.
(CSC 102) Lecture 30 Discrete Structures. Graphs.
Map Coloring Vertex Drawing Txt: mini excursion 2 (p ) & SOL: DM.1 Classwork Project Assigned due in two blocks (print the rubric at the end of.
13.4 Product of Two Matrices
15. Directed graphs and networks
Basic Concepts Graphs For more notes and topics visit:
CS 367 – Introduction to Data Structures
Matrix Representation of Graph
Matrices.
WarmUp 2-3 on your calculator or on paper..
Can you draw this picture without lifting up your pen/pencil?
Chapter 4 Review Math Analysis
Representations of Three-Dimensional Figures
Splash Screen.
Euler Paths and Circuits
Graph Theory Unit 2.
Draw isometric views of three-dimensional figures.
Splash Screen.
Walks, Paths, and Circuits
Graph Theory By Amy C. and John M..
Konigsberg- in days past.
Graphs.
Decision Maths Graphs.
B D E What is the difference between a point and a vertex?
Cornell Notes: Euler Paths and Circuits
Representations of Three-Dimensional Figures
Discrete Mathematics Lecture 12: Graph Theory
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 G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
Algorithms Lecture # 27 Dr. Sohail Aslam.
12 Further mathematics Adjacency Matrices.
CHAPTER 15 Graph Theory.
Graph Vocabulary.
Presentation transcript:

Vertex Edge Graphs

What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:

Vertex  A point on the graph.

Edge  A line segment or curve connecting the vertices of a graph.

In the Real-World  Vertices may represent things such as people or places.  Edges may represent connections such as roads or relationships. What are the edges, and what do they represent? What about the vertices?

Complete Graph  A graph in which every vertex is adjacent to every other vertex.  Which of these is complete?

Digraph  A directed vertex edge graph

Degree of the Vertex  The number of edges that enter a vertex. What is the degree of vertex A? What is the degree of vertex C?

Real World Example  The vertex edge graph below represents five people: Bob (B), Dustin (D), Mike (M), Sue (S) and Tammy (T).  An edge connecting two vertices indicates that those two people have a class together.

Who has a class with Mike? Tammy & Sue

Who does not have a class with Bob? Tammy & Mike

Using Matrices to Represent a Vertex-Edge Graph  We can use an adjacency matrix to represent the vertex-edge graph.  Step 1: Create a matrix listing all vertices in the row and column.  Step 2: Fill in the matrix listing the number of relationships between the two points.  If they share an edge, there will be a “1”  If there is no relationship, there will be a “0”

Create a Matrix using the following Vertex-Edge Graph:

R V U T S

Drawing a Vertex-Edge Graph  Use the following matrix to create the vertex-edge graph that corresponds.

Drawing a Vertex-Edge Graph  Use the following matrix to create the vertex-edge graph that corresponds.

Extended Relationships  A railway serves four cities: Harrisburg, Baltimore, Philadelphia and Atlantic City. Trains travel between Harrisburg and Baltimore, Harrisburg and Philadelphia, and Philadelphia and Atlantic City.  Draw a vertex edge graph and it’s adjacency matrix to represent this situation.

Railway Continued…

Summary  On a separate sheet of paper to turn in, list:  3 vocabulary words you have learned and their relationship to the vertex-edge graph  2 reasons to use a vertex-edge graph  1 real-world example of a vertex-edge graph