12 Further mathematics Adjacency Matrices.

Slides:

Advertisements

Similar presentations

Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.

Advertisements

Exercise Exercise3.1 8 Exercise3.1 9 Exercise

Lecture 16 CSE 331 Oct 9, Announcements Hand in your HW4 Solutions to HW4 next week Remember next week I will not be here so.

Exercise Exercise Exercise Exercise

Exercise Exercise Exercise Exercise

Exercise Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.

Graph G is shown: And 7 of its subgraphs are: How many of these subgraphs are induced?

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

9.3 Representing Graphs and Graph Isomorphism

Matrix Equations Step 1: Write the system as a matrix equation. A three-equation system is shown below.

Do Now: Evaluate: 3AB. Algebra II 3.7: Evaluate Determinants HW: p.207 (4-14 even) Test : Friday, 12/6.

Class 7: Answers 1 (C) Which of the following matrices below is in reduced row echelon form? A B C D. None of them.

 Remember back in geometry when you did translations? A translation is a. The coordinates of a point use a rule to move from its to its. slide preimageimage.

EXAMPLE 2 Add and subtract matrices 5 –3 6 – –4 + a. –3 + 2

© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.

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.

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

Worksheet Answers Matrix worksheet And Matrices Review.

EXAMPLE 3 Use matrices to rotate a figure SOLUTION STEP 1Write the polygon matrix: Trapezoid EFGH has vertices E(–3, 2), F(–3, 4), G(1, 4), and H(2, 2).

Math 10 N & M Unit Lesson (2) Digraphs and Matrices.

Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.

Module Code MA1032N: Logic Lecture for Week Autumn.

12 FURTHER MATHEMATICS Compound interest investments with regular additions to the principal (annuity investments)

Equation for a Vertical Line and a Horizontal Line

13.4 Product of Two Matrices

Applied Discrete Mathematics Week 14: Trees

Matrix Representation of Graphs

Introduction to Graphs

Graph Representations

15. Directed graphs and networks

Relations and Functions

Review Problems Matrices

Introduction to Graphs

Matrix arithmetic: addition, subtraction and scalar multiplication

Olympic Records Can you deduce which event Graph 1 represents?

! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!

Investigating associations between two numerical variables

4-4 Geometric Transformations with Matrices

CS223 Advanced Data Structures and Algorithms

How am I doing? Summative Tests– 1st Quarter 100% 90% 80% 70% 60% 50%

Nuffield Free-Standing Mathematics Activity

Walks, Paths, and Circuits

Graphs – Adjacency Matrix

Graph Theory By Amy C. and John M..

EXAMPLE 2 Add and subtract matrices 5 –3 6 – –4 + a. –3 + 2

Algorithms Lecture # 30 Dr. Sohail Aslam.

Y The graph of a rule connecting x and y is shown. From the graph, when x is -1, what is y? Give me a value of x that makes y positive, negative, equal.

THE NORMAL DISTRIBUTION AND THE 68–95–99.7% RULE

Discrete Mathematics Lecture 12: Graph Theory

Objective - To graph ordered pairs.

CALCULATING EQUATION OF LEAST SQUARES REGRESSION LINE

Discrete Mathematics Lecture 13_14: Graph Theory and Tree

Trees and minimum connector problems

Graphs G = (V, E) V are the vertices; E are the edges.

Adjacency Matrices and PageRank

GRAPHS G=<V,E> Adjacent vertices Undirected graph

! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!

Degree Distribution Ralucca Gera,

Binary, permutation, communication and dominance matrices

9.4 Connectivity.

Graph Vocabulary.

Matrix arithmetic: the product of two matrices

Name the quadrant or the axis on which the following points lie.

Ordered Pair – (11 - 2) CS-708.

Precedence tables and activity networks

Functions What is a function? What are the different ways to represent a function?

Introduction to Graphs

Presentation transcript:

12 Further mathematics Adjacency Matrices

Summarising the connections in a graph A matrix can be used to summarise the information in a graph. A matrix that records the number of connections between vertices of a graph is called an adjacency matrix. A graph and the adjacency matrix for that graph are shown overleaf.

Summarising the connections in a graph

Summarising the connections in a graph

Summarising the connections in a graph

Exercise 14B All Questions WORK TO BE COMPLETED Exercise 14B All Questions