King's Graph

More specifically, an

n 	imes m

king's graph is a king's graph of an

n 	imes m

chessboard.

For a

n 	imes m

king's graph the total number of vertices is simply

n m

.

For a

n 	imes n

king's graph the total number of vertices is simply

n^2

and the total number of edges is

2 n (2 n + 1)

.
Additionally, the number of edges for for various

n

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

SEE ALSO

Information About