halved cube graph
graph whose vertices are binary numbers with even numbers of nonzero bits and whose edges connect closest pairs in Hamming distance
en-US/ˈhævd ˈkjub ˈɡɹæf/
en-GB/ˈhɑːvd kjuːb ɡɹɑːf/
graph whose vertices are binary numbers with even numbers of nonzero bits and whose edges connect closest pairs in Hamming distance