Complete bipartite graph
Bipartite graph where each node of 1st set is linked to all nodes of 2nd set
- 3 min read
- 3 chapters
Related on Lably
Through Mathematics, Leonhard Euler and Necessity and sufficiency
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.
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 v1 ∈ V1 and v2 ∈ V2, v1v2 is an edge in E. A complete bipartite graph with partitions of size |V1| = m and |V2| = n, is denoted Km,n; every two graphs with the same notation are isomorphic.
Sign in to keep reading
2 more chapters are free with a Lably account.
Examples
- For any k, K1,k is called a star. 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.
- 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.
- The maximal bicliques found as subgraphs of the digraph of a relation are called concepts. When a lattice is formed by taking meets and joins of these subgraphs, the relation has an Induced concept lattice. This type of analysis of relations is called formal concept analysis.
Properties
- Given a bipartite graph, testing whether it contains a complete bipartite subgraph Ki,i for a parameter i is an NP-complete problem.
- A planar graph cannot contain K3,3 as a minor; an outerplanar graph cannot contain K3,2 as a minor (These are not sufficient conditions for planarity and outerplanarity, but necessary). Conversely, every nonplanar graph contains either K3,3 or the complete graph K5 as a minor; this is Wagner's theorem.
- Every complete bipartite graph. Kn,n is a Moore graph and a (n,4)-cage.
- The complete bipartite graphs Kn,n and Kn,n+1 have the maximum possible number of edges among all triangle-free graphs with the same number of vertices; this is Mantel's theorem. Mantel's result was generalized to k-partite graphs and graphs that avoid larger cliques as subgraphs in Turán's theorem, and these two complete bipartite graphs are examples of Turán graphs, the extremal graphs for this more general problem.
- The complete bipartite graph Km,n has a vertex covering number of min{m, n} and an edge covering number of max{m, n}.
- The complete bipartite graph Km,n has a maximum independent set of size max{m, n}.
- The adjacency matrix of a complete bipartite graph Km,n has eigenvalues √nm, −√nm and 0; with multiplicity 1, 1 and n + m − 2 respectively.
- The Laplacian matrix of a complete bipartite graph Km,n has eigenvalues n + m, n, m, and 0; with multiplicity 1, m − 1, n − 1 and 1 respectively.
- A complete bipartite graph Km,n has mn−1 nm−1 spanning trees.
- A complete bipartite graph Km,n has a maximum matching of size min{m,n}.
- A complete bipartite graph Kn,n has a proper n-edge-coloring corresponding to a Latin square.
- Every complete bipartite graph is a modular graph: every triple of vertices has a median that belongs to shortest paths between each pair of vertices.