King's graph
= King's graph
{wiki=King's_graph}
In graph theory, King’s graph, denoted as \\( K_n \\), is a specific type of graph that is related to the movement of a king piece in chess on an \\( n \\times n \\) chessboard. Each vertex in King's graph represents a square on the chessboard, and there is an edge between two vertices if a king can move between those two squares in one move.