The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may only make moves which simultaneously shift one square along one axis and two along the other). It is therefore a (1,2)-leaper graph, as well as the Euclidean distance-sqrt(5) graph. n×n knight graphs abstracted from the chessboard are illustrated above for n=3, ..., 6. The 1×1 knight graph is the...
