00:01
So we are given this graph and we have to draw its adjacency matrix.
00:05
So what does an adjacency matrix mean? it means that we'll draw a matrix a corresponding to this graph wherein each entry a .i .j of that graph where i represents the row number and j represents the column number.
00:27
And aij would be one if there exists an edge between the nodes i and j, that's starting from i and ending at j and it will be zero if there does not exist an edge between i and j so let's try to make a matrix for the given graph we see that the nodes in the graph are numbered from one to four so that means i will be varying from one to four and so will j all right so there exist or their three edges from 1 namely e4, e2 and e1.
01:21
That means a14, a12 and a13 would be filled with a 1.
01:37
The first rows, second, third, and fourth columns would have 1 as their values.
01:45
But there does not exist an edge starting from 1 and pointing to itself.
01:50
So that would mean we would fill it with a 0...