In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.^{[1]}^{[2]}
Complete bipartite graph | |
---|---|
Vertices | n + m |
Edges | mn |
Radius | |
Diameter | |
Girth | |
Automorphisms | |
Chromatic number | 2 |
Chromatic index | max{m, n} |
Spectrum | |
Notation | K_{{m,n} } |
Table of graphs and parameters |
Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete bipartite graphs were already printed as early as 1669, in connection with an edition of the works of Ramon Llull edited by Athanasius Kircher.^{[3]}^{[4]} Llull himself had made similar drawings of complete graphs three centuries earlier.^{[3]}
A complete bipartite graph is a graph whose vertices can be partitioned into two subsets V_{1} and V_{2} such that no edge has both endpoints in the same subset, and every possible edge that could connect vertices in different subsets is part of the graph. That is, it is a bipartite graph (V_{1}, V_{2}, E) such that for every two vertices v_{1} ∈ V_{1} and v_{2} ∈ V_{2}, v_{1}v_{2} is an edge in E. A complete bipartite graph with partitions of size |V_{1}| = m and |V_{2}| = n, is denoted K_{m,n};^{[1]}^{[2]} every two graphs with the same notation are isomorphic.
K_{3,3} | K_{4,4} | K_{5,5} |
---|---|---|
3 edge-colorings |
4 edge-colorings |
5 edge-colorings |
Regular complex polygons of the form 2{4}p have complete bipartite graphs with 2p vertices (red and blue) and p^{2} 2-edges. They also can also be drawn as p edge-colorings. |