Buy Me a Coffee at ko-fi.com

Halved cube graph

graph whose vertices are binary numbers with even numbers of nonzero bits and whose edges connect closest pairs in Hamming distance

Pronunciation
/hɑːvd kjuːb ɡrɑːf/
/hævd kjub ɡræf/