McqMate

Q. |
## 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. | n |

B. | n/2 |

C. | n/4 |

D. | data insufficient |

Answer» B. n/2 | |

Explanation: we can prove this by calculus. let x be the total number of vertices on set x. therefore set y will have n-x. we have to maximize x*(n-x). this is true when x=n/2. |

1.3k

0

Do you find this helpful?

15

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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 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 graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- 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?
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- 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.