[Solved] Are trees bipartite?

Q.	Are trees bipartite?
A.	yes
B.	no
C.	yes if it has even number of vertices
D.	no if it has odd number of vertices
Answer» A. yes
Explanation: condition needed is that there should not be an odd cycle. but in a tree there are no cycles at all. hence it is bipartite.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

What is testing of a complete bipartite subgraph in a bipartite graph problem called?
Which term defines all the complete bipartite graph that are trees?
How many spanning trees does a complete bipartite graph contain?
Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
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 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?
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?