(a) Prove that a graph is bipartite if and only if its vertices can be labeled so th...

(a) Prove that a graph is bipartite if and only if its vertices can be labeled so that its adjacency matrix can be partitioned as

(b) Using the result in part (a), prove that a bipartite graph has no circuits of odd length.