- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Given G is a bipartite graph and the bip...

Q. |
## Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them? |

A. | number of vertices in u = number of vertices in v |

B. | sum of degrees of vertices in u = sum of degrees of vertices in v |

C. | number of vertices in u > number of vertices in v |

D. | nothing can be said |

Answer» B. sum of degrees of vertices in u = sum of degrees of vertices in v | |

Explanation: we can prove this by induction. by adding one edge, the degree of vertices in u is equal to 1 as well as in v. let us assume that this is true for n-1 edges and add one more edge. since the given edge adds exactly once to both u and v we can tell that this statement is true for all n vertices. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- 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.
- A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
- Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?
- Can there exist a graph which is both eulerian and is bipartite?

Login to Continue

It will take less than 2 minutes

Report MCQ