Knight's graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Knight's graph
Knight's graph.svg
knight's graph
Girth 4 (if and )
Properties bipartite

In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard. Each vertex of this graph represents a square of the chessboard, and each edge connects two squares that are a knight's move apart from each other. More specifically, an knight's graph is a knight's graph of an chessboard.[1] Its vertices can be represented as the points of the Euclidean plane whose Cartesian coordinates are integers with and (the points at the centers of the chessboard squares), and with two vertices connected by an edge when their Euclidean distance is .

For a knight's graph the total number of vertices is simply . For a knight's graph the total number of vertices is simply and the total number of edges is .[2]

A Hamiltonian cycle on the knight's graph is a knight's tour.[1] A chessboard with an odd number of squares has no tour, because the knight's graph is a bipartite graph and only the bipartite graphs with an even number of vertices can have Hamiltonian cycles. All but finitely many chessboards with an even number of squares have a knight's tour; Schwenk's theorem provides an exact listing of which ones do and which do not.[3]

When it is modified to have toroidal boundary conditions (meaning that a knight is not blocked by the edge of the board, but instead continues onto the opposite edge) the knight's graph is the same as the four-dimensional hypercube graph.[3]

See also[edit]


External links[edit]