&o The graph is not bipartite .o Theorem 5.5: A graph is bipartite iff it does not contain any odd simple circuit .o Proof: (1)Let G be bipartite, we prove it does not contain any odd simple circuit Let C=(vo, v1,.,Vm Vo) be an simple circuit of G❖ The graph is not bipartite ❖ Theorem 5.5:A graph is bipartite iff it does not contain any odd simple circuit. ❖ Proof:(1)Let G be bipartite , we prove it does not contain any odd simple circuit. ❖ Let C=(v0 ,v1 ,…,vm,v0 ) be an simple circuit of G