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.

Rook graphs are sometimes also known as lattice graphs (e.g., Brouwer). Another class of graph sometimes given this name are the "lattice
graphs" of Ball and Coxeter (1987, p. 305) obtained by taking the ordered pairs of the first positive integers as vertices and drawing an edge between
all pairs having exactly one number in common.

## See also

Grid Graph,

Rook Graph,

Square Graph,

Triangular
Grid Graph
## Explore with Wolfram|Alpha

## References

Ball, W. W. R. and Coxeter, H. S. M. *Mathematical
Recreations and Essays, 13th ed.* New York: Dover, 1987.Brouwer,
A. E. "Lattice Graphs." http://www.win.tue.nl/~aeb/drg/graphs/Hamming.html.## Referenced
on Wolfram|Alpha

Lattice Graph
## Cite this as:

Weisstein, Eric W. "Lattice Graph." From
*MathWorld*--A Wolfram Web Resource. https://mathworld.wolfram.com/LatticeGraph.html