Question

find R foreach of the following by tracing and then Warshall 1. Find the adjacency matrix and adjacency relation for the following graph 2. Find the adjacency matrix and adjacency relation for the following graph 3. Find the corresponding directed graph and adjacency relation for the following adjacency matrix. TO 0 A = 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 1 0] 1 0 0 0

Answer 1

1]

given graph is

VANUATU C. EU Scanned with CamScanner

for ajdjacency matrcs we draw n*n marics where n= total vertax in given graph

and matrics[i,j] = 0 if there is no edge from vertac 'i' to vertax 'j' and matrics[i,j] =1 if there is an edge from vertac 'i' to vertax 'j'

from given graph adjacency matrix is

Adjacency matrica 1 2 3 ili 007 2 1 0 1 - 3 Lolo Scanned with CamScanner

for adjacency relation we make a column of size n where n is vertax in graph and each block link with a list which represent adjacence vertax of that vertax.

adjacency relation is

V OICE E DICAL Agacency lift Fyll nule 2777 3. NULL | 372 NULL Scanned with CamScanner

2]

given graph is

0 3 cs Scanned with CamScanner

for ajdjacency matrcs we draw n*n marics where n= total vertax in given graph

and matrics[i,j] = 0 if there is no edge from vertac 'i' to vertax 'j' and matrics[i,j] =1 if there is an edge from vertac 'i' to vertax 'j'

from given graph adjacency matrix is

Adjacency matrice 1 2 3 4 o o lo 20010 3 1 0 0 0 1 4 LO 0 0 I Scanned with CamScanner

for adjacency relation we make a column of size n where n is vertax in graph and each block link with a list which represent adjacence vertax of that vertax.

adjacency relation is

Dojacency list 17 3 Nowe 12 *13 NOLL 3 14 NULL 147 4 NULL Scanned with CamScanner

3]

given matrix is

given matrics 1 2 3 4 5 oтo o o тo o o o | т oo oo o чтого о о 5Loo I Lo) CS Scanned with CamScanner

from adjacency matrix if we draw graph then make n vertax where n = number of row in matrix

and look which matrix entry matrix[i,] =1 then make an edge from vertax i to vertax j in the graph ...

so graph is

distected graph Scanned with CamScanner

and from adjacency matrix or graph , we can easily draw adjacency relation which is-

Ayacency relation L OVE 4 NULL 75 Nuce -overed 72 NULY → 3 4 NULL cantaresca CamScanner