Question

What are the bipartite graphs explain with the help of example?

Answer 1

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A bipartite graph is a special case of a k-partite graph with . The illustration above shows some bipartite graphs, with vertices in each graph colored based on to which of the two disjoint sets they belong.

Answer 2

Bipartite Graph:

Bipartite graph is also called as bi-graph. It is set of “graph vertices” decomposed into a two disjoint sets in a way that no “two graphs” are adjacent to each other. It means in which the set of vertices which can be divided into two sets P and Q.

G (P, Q, E)

P and Q are the vertices,

E is edge of the graph.

Example:

G (E) = (AJ, BG, CF, DH, EI)