Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Ofcourse, In hamming graph, what I asked for, two vertices are adjacent if their hamming distance is 1. But in Hq(n,d) vertices are adjacent if their hamming distance is larger or equal to d.
Hq(n; d), has as vertices all the q-ary sequences of length n, and two vertices are adjacent if their Hamming distance is larger or equal to d. So it will not represent classical hamming graph as q=2.
