# Question:

Prove: Let C be the number of connected components in G. Then

the number of connected components in G′ is 2C if and only if the

graph G is bipartite.

Please help!

# Expert Answer:

Bipartite Graph (Bm,n): simple

Graph G(V,E) is called Bipartite iff there are two partition of a

vertex set in G such that there is No edge between two vertices