Domination of the rectangular queen's graph
S\'andor Boz\'oki, P\'eter G\'al, Istv\'an Marosi, William D. Weakley

TL;DR
This paper determines the domination and independent domination numbers of rectangular queen's graphs for boards up to 18x18, providing exact values, bounds, and minimal dominating sets, with some non-monotonicity observed.
Contribution
It offers the first comprehensive calculations of domination and independent domination numbers for these graphs within the specified size range, including minimal sets and bounds.
Findings
Exact domination numbers for boards up to 18x18.
Bounds on domination numbers based on board dimensions.
Identification of non-monotonicity in domination parameters.
Abstract
The queen's graph has the squares of the chessboard as its vertices; two squares are adjacent if they are in the same row, column, or diagonal of the board. A set of squares of is a dominating set for if every square of is either in or adjacent to a square in . The minimum size of a dominating set of is the domination number, denoted by . Values of are given here, in each case with a file of minimum dominating sets (often all of them, up to symmetry) in an online appendix at https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i4p45/HTML. In these ranges for and , monotonicity fails once: $\gamma(Q_{8 \times 11}) = 6 > 5 = \gamma(Q_{9 \times 11}) = \gamma(Q_{10 \times 11}) =…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
