MONT

H2
Representations of Graphs 0X X

Presented by : Joan V. Develos

Prese
Title ntation

PRESE
N TATION
TAGLIN
E
 y Matrix
Adjacenc

2
 y Matrix
Adjacenc
A square matrix used to represent a
finite graph. The elements of the matrix
indicate whether pairs of vertices are
adjacent or not in the graph

For a simple graph with vertex set U =

{u1, …, un}, the adjacency matrix is a
square n × n matrix A such that its
element Aij is one when there is an edge
from vertex ui to vertex uj, and zero
when there is no edge

3
 ts Adjacency
Graph and i
Matrix

4
 ts Adjacency
Graph and i
Undirected Graph

Matrix

5
 ts Adjacency
Graph and i
Directed Graph

Matrix

6
Exercises:

Write the Adjacency Matrix for the graph:

7
Exercises:

Answer:

8
 owe rs o f the
P atrix
Adjac en c y M

If A is the adjacency matrix of a

simple graph, the i j th entry of An
is equal to the number of paths of
length n from vertex i to vertex j , n
= 1, 2, . For example,

The value 2 represents the number of paths of length 2

from vertex a to vertex c

9
 o f A djac e ncy
Powers o nt’d
Ma tr ix C

Example

The entry from row d, column e is 6, which means that there are six
paths of length 4 from d to e. By inspection, we find them to be:

10
 e Matrix
Incidenc

11
 ce Matrix
Inciden
The Incidence Matrix describes which
branches are incident at which nodes
and what are the orientations relative
to the respective nodes

To obtain the incidence matrix of the

graph, we label the rows with the
vertices and the columns with the
edges. The entry for row v and column
e is 1 if e is incident on v and 0
otherwise.

12
 ts Incidence
Graph and i
Matrix

13
Thank
You!
God B
le ss !