Question

In a bipartite graph having a vertex partition V, and V2. a matching of vertices in Vi in to
those in V, is matching in which there is one edge incident with every vertex in V;.
Maximal
O
Complete
Below
Distinct
Ba

​

Answer 1

Answer:

sorry friend I don't know this answer