BIPARTITE GRAPH

In the mathematical field of graph theory, a 'bipartite graph' is a graph whose vertices can be divided into two disjoint sets $V\_1$ and $V\_2$ such that every edge connects a vertex in $V\_1$ and one in $V\_2$; that is, there is no edge between two vertices in the same set.

Contents

Intuitive definition

Mathematical definition

Applications

Examples

Properties

See also

External links

Intuitive definition

It is possible to color the nodes of a bipartite graph red and blue such that no edge exists between like colors. For example, this is impossible in the case of a fully connected graph with 3 vertices (a triangle): after one node is colored red and another blue, the remaining one is connected to both but must have the same colour as either.

Mathematical definition

A simple undirected graph $G\; =\; (V,\; E)$ is called 'bipartite' if there exists a partition $V\; =\; V\_1\; cup\; V\_2$ of the vertex set so that every edge in ''E'' is of the form ''v''₁''v''₂ for some ''v''₁ in ''V''₁ and ''v''₂ in ''V''₂. One often writes $G\; =\; (V\_1\; +\; V\_2,\; E)$ to denote a bipartite graph whose partition has the parts $V\_1$ and $V\_2$. If $|V\_1|\; =\; |V\_2|$, that is, if the number of elements in $V\_1$ is equal to the number of elements in $V\_2$, then $G$ is called a ''balanced'' bipartite graph.

Applications

Bipartite graphs are useful for modelling matching problems. An example of bipartite graph is a job matching problem. Suppose we have a set ''P'' of people and a set ''J'' of jobs, with not all people suitable for all jobs. We can model this as a graph with ''P'' + ''J'' the set of vertices. If a person $p\_i$ is suitable for a certain job $j\_i$ there is an edge between $p\_i$ and $j\_i$ in the graph. The marriage theorem provides a characterization of bipartite graphs which allow perfect matchings.
Bipartite graphs are extensively used in modern Coding theory, especially to decode codewords received from the channel. Factor graphs and Tanner graphs are examples of this.
In computer science, a Petri net is a mathematical modelling tool used in analysis and simulations of concurrent systems. A system is modelled as a bipartite directed graph with two sets of nodes: A set of "place" nodes that contain resources, and a set of "event" nodes which generate and/or consume resources. There are additional constraints on the nodes and edges that constrain the behavior of the system. Petri nets utilize the properties of bipartite directed graphs and other properties to allow mathematical proofs of the behavior of systems while also allowing easy implementation of simulations of the system.

Examples

★ Every tree is bipartite.

★ Cycle graphs with an even number of vertices are bipartite.

Properties

★ A graph is bipartite if and only if it does not contain an odd cycle. Therefore, a bipartite graph cannot contain a clique of size 3 or more.

★ A graph is bipartite if and only if it is 2-colorable, (i.e. its chromatic number is less than or equal to 2).

★ The size of minimum vertex cover is equal to the size of the maximum matching (König's theorem).

★ The size of the maximum independent set plus the size of the maximum matching is equal to the number of vertices.

★ For a connected bipartite graph the size of the minimum edge cover is equal to the size of the maximum independent set.

★ For a connected bipartite graph the size of the minimum edge cover plus the size of the minimum vertex cover is equal to the number of vertices.

★ Every bipartite graph is a perfect graph.

See also

★ Complete bipartite graph

★ Dulmage-Mendelsohn Decomposition

★ Levi graph

External links

★ Information System on Graph Class Inclusions: bipartite graph

★