## Quick Reference

A simple graph, denoted by *Q*_{n}, whose vertices and edges correspond to the vertices and edges of an *n*-dimensional hypercube. Thus, there are 2^{n} 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 *Q*_{2} and *Q*_{3} are shown in the figure.

*Subjects:*
Mathematics.

## Related content in Oxford Index

##### Reference entries

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