[Solved] Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
Given that a graph contains no odd cycle...

Q.	Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?
A.	yes
B.	no
Answer» A. yes
Explanation: it is required that the graph is connected also. if it is not then it cannot be called a bipartite graph.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

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.
Given G is a bipartite graph and the bipartitions of this graphs 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)
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?