# Maximum Bipartite Matching Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 1
..... is a matching with the largest number of edges.
 A Maximum bipartite matching B Non-bipartite matching C Stable marriage D Simplex

Question 1 Explanation:
Maximum bipartite matching matches two elements with a property that no two edges share a vertex.

 Question 2
Maximum matching is also called as maximum cardinality matching.
 A True B False

Question 2 Explanation:
Maximum matching is also called as maximum cardinality matching (i.e.) matching with the largest number of edges.

 Question 3
How many colours are used in a bipartite graph?
 A 1 B 2 C 3 D 4

Question 3 Explanation:
A bipartite graph is said to be two-colourable so that every edge has its vertices coloured in different colours.

 Question 4
What is the simplest method to prove that a graph is bipartite?
 A It has a cycle of an odd length B It does not have cycles C It does not have a cycle of an odd length D Both odd and even cycles are formed

Question 4 Explanation:
It is not difficult to prove that a graph is bipartite if and only if it does not have a cycle of an odd length.

 Question 5
A matching that matches all the vertices of a graph is called?
 A Perfect matching B Cardinality matching C Good matching D Simplex matching