KK graph | Latin square graph | rook's graph | rook's tour graph

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product K_m square K_n of complete graphs. By analogy with the KC graph and KP graph, the m×n rook graph could also be called a "KK graph." It is equivalent to the line graph L(K_(m, n)) of the complete bipartite graph K_(m, n), which is the definition adopted for example by Brualdi and Ryser (although restricted to the case m = n).

bishop graph | black bishop graph | circulant graph | grid graph | KC graph | king graph | knight graph | rook complement graph | square graph | triangular graph | triangular honeycomb rook graph | white bishop graph

GraphData

chess