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