made with Mathematica technology MathWorld

Lattice Graph
DOWNLOAD Mathematica Notebook

There are two conflicting definitions of the lattice graph. Ball and Coxeter (1987, p. 305) define a lattice graph Sq_n as the graph obtained by taking the n^2 ordered pairs of the first n positive integers as vertices and drawing an edge between all pairs having exactly one number in common. In this work, such a graph will be regarded as a generalized square graph.

RooksTour

The more usual definition of a lattice graph L_(m,n) (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) is the line graph of the complete bipartite graph K_(m,n). This is the definition adopted for example by Brualdi and Ryser (1991, p. 153), although restricted to the case m=n. This form of lattice graph corresponds to a rook's tour graph on an m×n chessboard, i.e., a tour by a chess piece that can move any number of spaces in a straight line (either horizontally or vertically, but not diagonally).

The lattice graph L_(m,m) is also isomorphic to the Latin square graph. The vertices of such a graph are defined as the n^2 elements of a Latin square of order n, with two vertices being adjacent if they lie in the same row or column or contain the same symbol. It turns out that all Latin squares of order n produce the same lattice graph.

The lattice graph L_(2,n) is also the graph complement of the crown graph on n vertices. The lattice graph L_(5,5) is isomorphic to the 25-cyclotomic graph.

Precomputed properties of lattice graphs are implemented in Mathematica as GraphData[{"Lattice", {m, n}}].

A lattice graph L_(m,n) is a circulant graph iff (m,n)=1 (i.e., m is coprime to n). In that case, the lattice graph is isomorphic to Ci_(mn)(m,2m,3m,...,mn/2,n,2n,3n,...,mn/2).

Special cases are summarized in the following table.

L_(m,n)isomorphic to
L_(2,3)prism graph Y_4
L_(2,2)square graph C_4
L_(2,5)circulant graph Ci_(10)(2,4,5)
L_(3,4)circulant graph Ci_(12)(3,4,6)

SEE ALSO: Grid Graph, Square Graph, Triangular Graph

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.

Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.

Brualdi, R. and Ryser, H. J. §6.2.4 in Combinatorial Matrix Theory. New York: Cambridge University Press, p. 152, 1991.

Godsil, C. and Royle, G. "Latin Square Graphs." §10.4 Algebraic Graph Theory. New York: Springer-Verlag, pp. 226-230, 2001.

van Dam, E. R. and Haemers, W. H. "Which Graphs Are Determined by Their Spectrum?" Lin. Algebra Appl. 373, 139-162, 2003.




CITE THIS AS:

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

The Wolfram Demonstrations Project Browse Topics View Latest
JUST RELEASED: Wolfram Mathematica 7