complete bipartite graph


complete bipartite graph

[kəm¦plēt bī′pär‚tīt ‚graf] (mathematics) A graph whose vertices can be partitioned into two sets such that every edge joins a vertex in one set with a vertex in the other, and each vertex in one set is joined to each vertex in the other by exactly one edge.