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

Complete graph

Start collecting facts
These are the best facts for Complete graph, collected by our users from the web:
(You can find the source through the icon at the end of each fact)
  1. a simple graph in which every pair of distinct vertices is connected by an edge

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 2, 2009
  2. 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
  3. on n vertices has n vertices and n(n-1)/2 edges, and is denoted by Kn

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 2, 2009
  4. a regular graph of degree n-1

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 2, 2009
  5. All complete graphs are their own cliques

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 2, 2009
Displaying the top 5 of 16 facts in total. Show all 16 factsShow 3 more or all 16 facts
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: