A graph is called bipartite if its vertices can be subdivided into two sets U and V such...

A graph is called bipartite if its vertices can be subdivided into two sets U and V such that every edge has one endpoint in U and the other endpoint in V. For example, the graph in Exercise 48 is bipartite with . In Exercises, determine whether a graph with the given adjacency matrix is bipartite.

The adjacency matrix in Exercise 49