McqMate

Q. |
## A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite) |

A. | 100 |

B. | 140 |

C. | 80 |

D. | 20 |

Answer» A. 100 | |

Explanation: let the given bipartition x have x vertices, then y will have 20-x vertices. we need to maximize x*(20-x). this will be maxed when x=10. |

4.2k

0

Do you find this helpful?

27

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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?
- 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?
- 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?
- 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?
- 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.
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.