ABSTRACT
In this chapter, we introduce two important classes of graphs: hypercubes and Hamming graphs. The first class forms one of the central models for interconnection networks and parallel computing, whereas Hamming graphs1 play an important role in metric graph theory and coding theory. These two classes also host many interesting and applicable classes of graphs as (induced, spanning, and isometric) subgraphs; for instance, median and quasi-median graphs, partial cubes, partial Hamming graphs, and Tower of Hanoi graphs, to list just a few.
