- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- When is a graph said to be bipartite?

Q. |
## When is a graph said to be bipartite? |

A. | if it can be divided into two independent sets a and b such that each edge connects a vertex from to a to b |

B. | if the graph is connected and it has odd number of vertices |

C. | if the graph is disconnected |

D. | if the graph has at least n/2 vertices whose degree is greater than n/2 |

Answer» A. if it can be divided into two independent sets a and b such that each edge connects a vertex from to a to b | |

Explanation: a graph is said to be bipartite if it can be divided into two independent sets a and b such that each edge connects a vertex from a to b. |

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?
- 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.
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
- 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 graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)

Login to Continue

It will take less than 2 minutes

Report MCQ