There is a Hamiltonian cycle for each queen's graph, and the graphs are biconnected (they remain connected if any single vertex is removed). The special cases of the ${\displaystyle 1\times n}$  and ${\displaystyle 2\times 2}$  queen's graphs are complete.^[1]

An independent set of the graph corresponds to a placement of several queens on a chessboard such that no two queens are attacking each other. In an ${\displaystyle n\times n}$  chessboard, the largest independent set contains at most n vertices, as no two queens can be in the same row or column.^[2] This upper bound can be achieved for all n except n=2 and n=3.^[3] In the case of n=8, this is the traditional eight queens puzzle.^[2]

A dominating set of the queen's graph corresponds to a placement of queens such that every square on the chessboard is either attacked or occupied by a queen. On an ${\displaystyle 8\times 8}$  chessboard, five queens can dominate, and this is the minimum number possible^{[4]: 113–114} (four queens leave at least two squares unattacked). There are 4,860 such placements of five queens, including ones where the queens control also all occupied squares, i.e. they attack respectively protect each other. In this subgroup, there are also positions where the queens occupy squares on the main diagonal only^{[4]: 113–114} (e.g. from a1 to h8), or all on a subdiagonal (e.g. from a2 to g8).^[5][6]

Modifying the graph by replacing the non-looping rectangular ${\displaystyle 8\times 8}$  chessboard with a torus or cylinder reduces the minimum dominating set size to four.^[4]: 139

The ${\displaystyle 3\times 3}$  queen's graph is dominated by the single vertex at the centre of the board. The centre vertex of the ${\displaystyle 5\times 5}$  queen's graph is adjacent to all but 8 vertices: those vertices that are adjacent to the centre vertex of the ${\displaystyle 5\times 5}$  knight's graph.^[4]: 117

Domination numbers edit

Define the domination number d(n) of an ${\displaystyle n\times n}$  queen's graph to be the size of the smallest dominating set, and the diagonal domination number dd(n) to be the size of the smallest dominating set that is a subset of the long diagonal. Note that ${\displaystyle d(n)\leq dd(n)}$  for all n. The bound is attained for ${\displaystyle d(8)=dd(8)=5}$ , but not for ${\displaystyle d(11)=5,dd(11)=7}$ .^[4]: 119

The domination number is linear in n, with bounds given by:^{[4]: 119, 121}

${\displaystyle {\frac {n-1}{2}}\leq d(n)\leq n-\left\lfloor {\frac {n}{3}}\right\rfloor .}$ 

Initial values of d(n), for ${\displaystyle n=1,2,3,\dots }$ , are 1, 1, 1, 2, 3, 3, 4, 5, 5, 5, 5 (sequence A075458 in the OEIS).

Let K_n be the maximum size of a subset of ${\displaystyle \{1,2,3,\dots ,n\}}$  such that every number has the same parity and no three numbers form an arithmetic progression (the set is "midpoint-free"). The diagonal domination number of an ${\displaystyle n\times n}$  queen's graph is ${\displaystyle n-K_{n}}$ .^[4]: 116

Define the independent domination number ID(n) to be the size of the smallest independent, dominant set in an ${\displaystyle n\times n}$  queen's graph. It is known that ${\displaystyle ID(n)<0.705n+0.895}$ .^[7]

A colouring of the queen's graph is an assignment of colours to each vertex such that no two adjacent vertices are given the same colour. For instance, if a8 is coloured red then no other square on the a-file, eighth rank or long diagonal can be coloured red, as a queen can move from a8 to any of these squares. The chromatic number of the graph is the smallest number of colours that can be used to colour it.

In the case of an ${\displaystyle n\times n}$  queen's graph, at least n colours are required, as each square in a rank or file needs a different colour (i.e. the rows and columns are cliques).^[1] The chromatic number is exactly n if ${\displaystyle n\equiv 1,5{\pmod {6}}}$  (i.e. n is one more or one less than a multiple of 6).^[9]

The chromatic number of an ${\displaystyle 8\times 8}$  queen's graph is 9.^[10]

A set of vertices is irredundant if removing any vertex from the set changes the neighbourhood of the set i.e. for each vertex, there is an adjacent vertex that is not adjacent to any other vertex in the set. This corresponds to a set of queens which each uniquely control at least one square. The maximum size IR(n) of an irredundant set on the ${\displaystyle n\times n}$  queen's graph is difficult to characterise; known values include ${\displaystyle IR(5)=5,IR(6)=7,IR(7)=9,IR(8)=11.}$ ^{[4]: 206–207}

Consider the pursuit–evasion game on an ${\displaystyle 8\times 8}$  queen's graph played according to the following rules: a white queen starts in one corner and a black queen in the opposite corner. Players alternate moves, which consist of moving the queen to an adjacent vertex that can be reached without passing over (horizontally, vertically or diagonally) or landing on a vertex that is adjacent to the opposite queen. This game can be won by white with a pairing strategy.^[11]

• King's graph
• Knight's graph
• Rook's graph
• Bishop's graph
•   Chess portal