1 Answer. Connected bipartite graph is a graph fulfilling both, following conditions: Vertices can be divided into two disjoint sets U and V (that is, U and V are each independent sets) such that every edge in graph connects a vertex in U to one in V.

Does a bipartite graph have to be connected?

Re: can a bipartite graph have two not connected parts? A bipartite graph can be disconnected. Wikipedia says: "One often writes G=(U,V,E) to denote a bipartite graph whose partition has the parts U and V, with E denoting the edges of the graph.

How do you know if a bipartite graph is connected?

In a connected graph, the maximum distance require to get from any node to any other is V−1 where V is the number of vertices. So to test whether a graph is connected, you can compute V−1∑i=1Ai: if there are no 0 entries, the graph is connected. If there are 0 entries, it's not.