Grid graph

From Wikipedia, the free encyclopedia

You have new messages (last change).

In graph theory, 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.

[edit] External links

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../g/r/i/Grid_graph.html"