Complete bipartite graph

From formulasearchengine
Jump to navigation Jump to search

Template:Infobox graph

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]

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]

Definition

A complete bipartite graph is a graph whose vertices can be partitioned into two subsets V1 and V2 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 (V1, V2, E) such that for every two vertices v1V1 and v2V2, v1v2 is an edge in E. A complete bipartite graph with partitions of size |V1|=m and |V2|=n, is denoted Km,n;[1][2] every two graphs with the same notation are isomorphic.

Examples

The star graphs S3, S4, S5 and S6.
The utility graph K3,3
  • For any k, K1,k is called a star.[2] All complete bipartite graphs which are trees are stars.
  • The graph K1,3 is called a claw, and is used to define the claw-free graphs.[5]
  • The graph K3,3 is called the utility graph. This usage comes from a standard mathematical puzzle in which three utilities must each be connected to three buildings; it is impossible to solve without crossings due to the nonplanarity of K3,3.[6]

Properties

See also

References

  1. 1.0 1.1 {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  2. 2.0 2.1 2.2 {{#invoke:citation/CS1|citation |CitationClass=citation }}. Electronic edition, page 17.
  3. 3.0 3.1 {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  4. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  5. {{#invoke:citation/CS1|citation |CitationClass=citation }}. Corrected reprint of the 1986 original.
  6. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  7. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  8. Diestel, elect. ed. p. 105.
  9. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  10. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  11. Template:Harvtxt, p. 266.
  12. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  13. {{#invoke:citation/CS1|citation |CitationClass=citation }}.