- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the simplest method to prove tha...

Q. |
## What is the simplest method to prove that a graph is bipartite? |

A. | it has a cycle of an odd length |

B. | it does not have cycles |

C. | it does not have a cycle of an odd length |

D. | both odd and even cycles are formed |

Answer» C. it does not have a cycle of an odd length | |

Explanation: it is not difficult to prove that a graph is bipartite if and only if it does not have a cycle of an odd length. |

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?
- When is a graph said to be bipartite?

Login to Continue

It will take less than 2 minutes

Report MCQ