![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Biclique_K_3_5.svg/640px-Biclique_K_3_5.svg.png&w=640&q=50)
Complete bipartite graph
Bipartite graph where each node of 1st set is linked to all nodes of 2nd set / From Wikipedia, the free encyclopedia
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]
Quick Facts Vertices, Edges ...
Complete bipartite graph | |
---|---|
![]() A complete bipartite graph with m = 5 and n = 3 | |
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 |
Close
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]