00:01
Hello, so here we suppose our graph g is the graph ve, so set of vertices and edges.
00:07
I suppose the vertices are v1, v2, the vn.
00:10
Now, the adjacency matrix of a is going to be the, where a sub i, j is going to be equal to the number of edges that are associated to v sub i, v subj.
00:24
So we have our given matrix here, a is the matrix 1, 3, 2, 3, 0, 4, 2 ,0.
00:36
So we suppose this is going to be the adjacency matrix of a graph g with respect to the order of the vertices, a, b, and c.
00:43
Well, then we get that our graph g is going to look like so.
00:48
So we have our vertices...