Lattice graph

This implies that the group of bijective transformations that send the graph to itself is a lattice in the group-theoretical sense.

Typically, no clear distinction is made between such a graph in the more abstract sense of graph theory, and its drawing in space (often the plane or 3D space).

This type of graph may more shortly be called just a lattice, mesh, or grid.

Moreover, these terms are also commonly used for a finite section of the infinite graph, as in "an 8 × 8 square grid".

In other words, it is the unit distance graph for the integer points in a rectangle with sides parallel to the axes.

All square grid graphs are bipartite, which is easily verified by the fact that one can color the vertices in a checkerboard fashion.

A Hanan grid graph for a finite set of points in the plane is produced by the grid obtained by intersections of all vertical and horizontal lines through each point of the set.

The valid moves of the fairy chess piece the wazir form a square lattice graph.