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:
“Fate forces its way to the powerful and violent. With subservient obedience it will assume for years dependency on one individual: Caesar, Alexander, Napoleon, because it loves the elemental human being who grows to resemble it, the intangible element. Sometimes, and these are the most astonishing moments in world history, the thread of fate falls into the hands of a complete nobody but only for a twitching minute.”
—Stefan Zweig (18811942)
“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)