complete bipartite graph
A graph split into two groups of sizes r and s, with every vertex in one group joined to every vertex in the other and no edges within a group.
The complete bipartite graph K_{r,s} has parts L (|L|=r) and R (|R|=s), with E(K_{r,s}) = \{\{u,v\} : u\in L, v\in R\} -- every cross edge present, no within-part edges.
Point table
Graph settings
Calculator