complete bipartite graph

The complete bipartite graphMathworldPlanetmath Kn,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, Kn,m is bipartite.

Examples of complete bipartite graphs:




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