bipartite graph


bipartite graph

[bī′pär‚tīt ′graf] (mathematics) A linear graph (network) in which the nodes can be partitioned into two groups G1 and G2 such that for every arc (i,j) node i is in G1 and node j in G2.

bipartite graph

complete graph