Hypercubes and Isometric Words based on Swap and Mismatch Distance

Marcella Anselmo, Giuseppa Castiglione, Manuela Flores +3

The hypercube of dimension n is the graph whose vertices are the 2^n binary words of length n, and there is an edge between two of them if they have Hamming distance 1. We consider…