Discussiones Mathematicae: Graph theory – Volume 23 – Page 228

Digest of Papers – Page 308 FOUND INSIDE – PAGE 308 Let Hi , j ) denotes the Hamming distance between any two components c and c ; in a Boolean N – cube . It is obvious that dd ( ij ) H ( 1 , j ) in a Boolean N – cube […]