A graph is said to be Bipartite if it’s set of vertices can be divided into two disjoint sets such that no two vertices of the same set are adjacent by some edge of the graph. It means that the edges of one set will be adjacent with the vertices of the other set.
No comments:
Post a Comment