A complete bipartite graph, G := (V1 + V2, E), is a bipartite graph such that for any two vertices, v1 ∈ V1 and v2 ∈ V2, v1v2 is an edge in G. The complete bipartite graph with partitions of size |V1|=m and |V2|=n, is denoted Km,n.
Read more about Complete Bipartite Graph: Examples, Properties
Famous quotes containing the words complete and/or graph:
“For which of you, intending to build a tower, does not first sit down and estimate the cost, to see whether he has enough to complete it?”
—Bible: New Testament, Luke 14:28.
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)