TOPICS
Search

Bipartite Complement


The bipartite complement of a bipartite graph G with specified bipartition (X,Y) is the bipartite graph on the same vertex set and with the same bipartition in which x in X and y in Y are adjacent iff they are not adjacent in G (Alecu et al. 2023). Equivalently, its edge set is the complement of the edge set of G within the complete bipartite graph on (X,Y). Thus the operation is defined relative to the chosen bipartition.

The bipartite complement differs from the ordinary graph complement, which also makes every pair of distinct vertices within X or within Y adjacent.


See also

Bipartite Graph, Bipartition, Complete Bipartite Graph, Graph Complement

Explore with Wolfram|Alpha

References

Alecu, B.; Atminas, A.; Lozin, V.; and Malyshev, D. "Combinatorics and Algorithms for Quasi-Chain Graphs." Algorithmica 85, 642-664, 2023. https://doi.org/10.1007/s00453-022-01019-6.

Cite this as:

Weisstein, Eric W. "Bipartite Complement." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BipartiteComplement.html

Subject classifications