n-cube
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.
- distance‐time graph
- distinct
- distribution
- distribution
- distribution function
- distribution‐free methods
- distributive
- div
- diverge
- divergence
- divergence theorem
- divides
- divisible
- division
- division
- division algebra
- Division Algorithm
- division ring
- divisor
- divisor function
- divisor of zero
- dodecagon
- dodecahedron
- Dodgson, Charles Lutwidge
- domain