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

Hypercube graph
also called Q n

Start collecting facts
These are the best facts for Hypercube graph, collected by our users from the web:
(You can find the source through the icon at the end of each fact)
  1. Qn is a regular graph with 2n vertices, which correspond to the subsets of a set with n elements

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 12, 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 12, 2009
  3. Two vertices labelled by subsets W and B are joined by an edge if and only if W can be obtained from B by adding or removing a single element

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 12, 2009
  4. Each vertex of Qn is incident to exactly n edges (that is, Qn is n-regular), so, by the handshaking lemma the total number of edges is 2n−1n

    Source: Wikipedia Unhappy with this fact? more info
    created by user picturefactobot on March 12, 2009
  5. The name comes from the fact that the hypercube graph is the one-dimensional skeleton of the geometric hypercube

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