00:01
All right, so for part a here, i'm going to find the adjacency matrix and the incidence matrix.
00:04
The graph is going to have vertices a, b, c, d, e.
00:08
Now, an adjacency matrix is going to be a square matrix used to represent a finite graph.
00:13
The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
00:19
So from the graph, we can say that a is connected to b and d.
00:28
B is connected to a, c, and e.
00:34
C is connected to b, d, b, d, and e.
00:40
And then d is to a and c, and e is to b and c.
00:47
So the adjacency matrix then, a, is going to be the matrix here.
00:51
We have 0, 1, 0, 1, 0...