Question 21
Which of the following statements about bipartite graphs is TRUE?
In a bipartite graph, there are two disjoint sets of vertices such that no two vertices within the same set are adjacent.
Every complete bipartite graph has an Eulerian circuit.
A bipartite graph can be colored with two colors such that no two adjacent nodes have the same color.
In the adjacency matrix of a bipartite graph, the values corresponding to edges within the same set of nodes will not all be zero.