In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U {\displaystyle U} and V {\displaystyle V} , that is, every edge connects a vertex in U {\displaystyle U} to one in V {\displaystyle V} . Vertex sets U {\displaystyle U} and V {\displaystyle V} are usually called the parts of the graph.
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U {\displaystyle U} and V {\displaystyle V} , that is, every edge connects a vertex in U {\displaystyle U} to one in V {\displaystyle V} . Vertex sets U {\displaystyle U} and V {\displaystyle V} are usually called the parts of the graph.
Source: Wikipedia "Bipartite graph" · CC BY-SA 4.0
Share this article: X · Bluesky