Knight's Tour Graph

More specifically, an

n 	imes m

knight's tour graph is a knight's tour graph of an

n 	imes m

chessboard.

For a

n 	imes m

knight's tour graph the total number of vertices is simply

n m

.

For a

n 	imes n

knight's tour graph the total number of vertices is simply

n^2

and the total number of edges is

4 (n-2)(n-1)

.
Additionally, the number of edges for for various

n

is identified as A033996 in the On-Line Encyclopedia Of Integer Sequences .

SEE ALSO

Information About