closeHello! Click here if you would like to know what Factolex is about.

Complete bipartite graph

One more term with the same name exists. Show the other term
Start collecting facts
These are the best facts for Complete bipartite graph, collected by our users from the web:
(You can find the source through the icon at the end of each fact)
  1. a term from the mathematical field of graph theory

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 2, 2009
  2. G:=(V₁ + V₂, E) is a bipartite graph such that for any two vertices v₁ ∈ V₁ and v₂ ∈ V₂ v₁ v₂ is an edge in G. The complete bipartite graph with partitions of size ≦ft|V₁\right|=m and ≦ft|V₂\right|=n, is denoted Km,n

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 2, 2009
Do you know more? Submit a new fact

Add a new fact

A fact should only contain one sentence, describing an aspect of the term.

Fact
Example: located on the west coast of the U.S
Source
Tags
optional

Example: geography location -- separate tags with spaces

Add one more fact or give me some inspiration from:

More lexica »Featured Lexica

Look at what our users have created already.

Feedback

Please tell us what you think about our project

Contribute

On Factolex you can add facts and terms that you believe are missing.

To be sure that the term hasn't already been entered, please use the search function before doing so.

Home  |  About  |  FAQ  |  Feedback  |  Tools  |  Stats  |  Contact Us  |  API  |  Blog
Change language to: