Mostly grid graphs are considered, the drawing of which forms a rectangular grid. These can be written as
This clearly means that the set of nodes contains the points with the integer coordinates from to on one axis and from to on the other axis of a right-angled coordinate system. Two nodes and are connected by an edge if and only if they have a distance of 1.
The grid graph consists of exactly four nodes and four edges and is isomorphic to the circular graph . The grid graphs of the form are called ladder graphs .