Grid
A grid graph is a unit distance graph corresponding to the square lattice, so that it is isomorphic to the graph having a vertex corresponding to every pair of integers (a, b), and an edge connecting (a, b) to (a+1, b) and (a, b+1). The finite grid graph Gm,n is an m×n rectangular graph isomorphic to the one obtained by restricting the ordered pairs to the range 0 ≤ a < m, 0 ≤ b < n. Grid graphs can be obtained as the Cartesian product of two paths: Gm,n = Pm × Pn. Every grid graph is a median graph.
Read more about this topic: List Of Graphs