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:
“Although my parents have never been the kind to hint around about grandchildren, I can think of no better tribute to them than giving them some.... I can’t help thinking that the cycle is not complete until I can introduce them to a child of their child. And I can think of no better comfort when they are gone than to know that something of them lives on, not only in me but in my children.”
—Anne Cassidy. “Every Child Should Have a Father But....,” McCall’s (March 1985)
“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)