halved cube graph
graph whose vertices are binary numbers with even numbers of nonzero bits and whose edges connect closest pairs in Hamming distance
tetrahedral graph
complete graph on 4 vertices
graph whose vertices are binary numbers with even numbers of nonzero bits and whose edges connect closest pairs in Hamming distance