McqMate

Q. |
## Which graph has a size of minimum vertex cover equal to maximum matching? |

A. | cartesian |

B. | tree |

C. | heap |

D. | bipartite |

Answer» D. bipartite | |

Explanation: the konig’s theorem given the equivalence relation between the minimum vertex cover and the maximum matching in graph theory. bipartite graph has a size of minimum vertex cover equal to maximum matching. |

2.5k

0

Do you find this helpful?

18

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- Maximum matching is also called as maximum cardinality matching.
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- 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?
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- Which is the correct technique for finding a maximum matching in a graph?
- 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?