A bipartite graph is a graph for which the set of vertices can be divided into two disjoint independent sets . A bipartite graph is called complete when every vertex of the first independent set is adjacent to all the vertices of the second independent set. We denote these complete bipartite graphs with , where , respectivly , is the size of the first, respectivly second, independent set. Below you can see and .
In GrInvIn you can create a complete bipartite graph by using the bipartite graph factory.