Skip to content

Bipartite graph

A bipartite graph is a type of graph where the vertices can be divided into two groups.

No two vertices within the same group are connected by an edge. Instead, edges only connect vertices from one group to vertices in the other group.

Bipartite graph: a graph where vertices can be divided into two groups, and edges only connect vertices from different groups.

A complete bipartite graph is a special type of bipartite graph where every vertex in one group is connected to every vertex in the other group.

A complete bipartite graph with groups of sizes m and n is often written as .

A complete bipartite graph has edges, since each of the m vertices in one group is connected to all n vertices in the other group.