1.

A graph 'G' with 'n' nodes is bipartite if it contains(A) n edges.(B) a cycle of odd length.(C) no cycle of odd length.(D) n2 edges. 

Answer»

(C) no cycle of odd length. 



Discussion

No Comment Found

Related InterviewSolutions