00:01
Hi, from the question given that we need to consider the given graph.
00:05
So from the given network, we have to use the cut vertex method in finding the number of spanning tree.
00:12
If a vertex is removed, results in a network divided, then we need to find the number of spanning tree in each side, then multiply the number of spanning tree in each side to get the result.
00:25
So first, here cd and ef are the two cut vertex.
00:35
If we remove these two segments, it will be divided into three graphs.
00:41
So a, b, c, m, n.
01:03
This is d, i, j, e, k, l and this is f, g, h.
01:14
Now here, compute the spanning tree of the three parts and then multiply.
01:21
So first, spanning tree of a, b, c, n, m is 5.
01:34
And similarly, spanning tree of d, i, j, e, k, l is 6.
01:44
And the spanning tree of g, f, h is 1.
01:51
So that the total spanning tree is obtained by multiplying all the spanning tree value...