00:01
Hi, now we are going to find the maximum matching.
00:12
Maximum matching is the matching which has the largest cardinality.
00:35
And the matching is, suppose m is a subset of e is a matching if no two edges in m share a vertex.
01:07
So for the given graph, the first matching m1 is equal to 5 .1, 0 .6, 7 .3 and 8 .2.
01:22
And the second matching m2 is equal to 6 .1, 7 .3 and 8 .2.
01:33
And the third matching m3 is equal to 6 .2, 7 .1, 8 .4 and 9 .3.
01:48
Here, the cardinality of m1 and m3 is 4 and that is the largest cardinality.
01:55
Therefore, m1 and m3 are the maximum matchings.
02:12
And next in part b we have to find the minimum vertex cover.
02:24
Minimum vertex cover is a smallest set of vertices that covers all the vertices in the graph.
02:55
In the given graph if i choose the vertex 6, then it will cover the vertices.
03:01
0, 1 and 2...