Q137
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
AnswerB.
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
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board