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:
“Much that is urged on us new parents is useless, because we didn’t really choose it. It was pushed on us. It—whether it be Raffi videos, French lessons, or the complete works of Brazelton—might be just right for you and your particular child. But it is only right when you feel that it is. You know your family best; you decide.”
—Sonia Taitz (20th century)
“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)