A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space 
that forms a regular tiling.
Examples include grid graphs and triangular
grid graphs.
Hamming graphs 
are also known as lattice graphs (Ball and Coxeter 1987,
p. 305; Brouwer). These are precisely the 
rook graphs: the vertices
are ordered pairs of elements of a 
-set, with two vertices adjacent when they agree in exactly
one coordinate.
