The integer 2-domination formula for three-row grids
Statement
Let denote the -by- grid graph, and let be its integer -domination number. The three-row grid conjecture. For every positive integer ,
The conjecture asserts that the upper bound proved in the paper is also a lower bound, giving the exact integer -domination number for three-row grids.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.