complete bipartite graph

The complete bipartite graph $K_{n,m}$ is a graph with two sets of vertices, one with $n$ members and one with $m$ , such that each vertex in one set is adjacent to every vertex in the other set and to no vertex in its own set. As the name implies, $K_{n,m}$ is bipartite.

Examples of complete bipartite graphs:

$K_{2,5}$ :

\xymatrix{&C\\ A\ar@{-}[ur]\ar@{-}[r]\ar@{-}[dr]\ar@{-}[ddr]\ar@{-}[dddr]&D\\ &E\\ B\ar@{-}[uuur]\ar@{-}[uur]\ar@{-}[ur]\ar@{-}[r]\ar@{-}[dr]&F\\ &G}

$K_{3,3}$ :

\xymatrix{A\ar@{-}[r]\ar@{-}[dr]\ar@{-}[ddr]&D\\ B\ar@{-}[ur]\ar@{-}[r]\ar@{-}[dr]&E\\ C\ar@{-}[uur]\ar@{-}[ur]\ar@{-}[r]&F}

Title	complete bipartite graph
Canonical name	CompleteBipartiteGraph
Date of creation	2013-03-22 12:17:13
Last modified on	2013-03-22 12:17:13
Owner	yark (2760)
Last modified by	yark (2760)
Numerical id	7
Author	yark (2760)
Entry type	Definition
Classification	msc 05C15