McqMate

Q. |
## In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called? |

A. | bipartite matching |

B. | cardinality matching |

C. | augmenting |

D. | weight matching |

Answer» C. augmenting | |

Explanation: a simple path from a free vertex in v to a free vertex in u whose edges alternate between edges not in m and edges in m is called a augmenting path. |

2.8k

0

Do you find this helpful?

4

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- What is the chromatic number of compliment of line graph of bipartite graph?
- What is the clique size of the line graph of bipartite graph?
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?