Q. When is a graph said to be bipartite? (Solved)
1. if it can be divided into two independent sets a and b such that each edge connects a vertex from to a to b
2. if the graph is connected and it has odd number of vertices
3. if the graph is disconnected
4. if the graph has at least n/2 vertices whose degree is greater than n/2
- 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