HIGHLIGHTS
SUMMARY
The n-dimensional hypercube Qn (also called the n-cube) is the graph on the vertex set {0, 1}n, where nodes x and y are adjacent iff H(x, y)=1. Call e an edge of Type i if e ∈ Ei, 0 ≤ i ≤ 3, and call e a cross edge if e ∈ E4. For a set S of integers, let (S + k) denote the set {i + k | i ∈ S}, and for a graph G, let (G + k) be the graph on the vertex set {x + k | x ∈ V(G)}, where {x + k, y . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.