The lower-bound conjecture for secure domination in subdivisions
Statement
Let be a graph, and let denote its -subdivision, obtained by replacing each edge with a path of length . Write for the secure domination number of a graph .
Secure-domination lower-bound conjecture. For every graph ,
The conjecture is motivated by examples showing that the secure domination number of a -subdivision can be smaller than both the number of edges and the number of vertices of the original graph; its status is not established in the supplied source.
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.