Show Summary Details

Quick Reference

A simple graph, denoted by Qn, whose vertices and edges correspond to the vertices and edges of an n-dimensional hypercube. Thus, there are 2n vertices that can be labelled with the binary words of length n, and there is an edge between two vertices if they are labelled with words that differ in exactly one digit. The graphs Q2 and Q3 are shown in the figure.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.