Complete Bipartite Graph
(Redirected from biclique)
Jump to navigation
Jump to search
A Complete Bipartite Graph is a bipartite graph that is a clique graph.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/complete_bipartite_graph Retrieved:2015-10-8.
- 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]
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. Llull himself had made similar drawings of complete graphs three centuries earlier.
- 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]
- ↑ . Electronic edition, page 17.