ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let G12G^{\frac{1}{2}} denote its 22-subdivision, obtained by replacing each edge with a path of length 22. Write γs(H)\gamma_s(H) for the secure domination number of a graph HH.

Secure-domination lower-bound conjecture. For every graph GG,

γs(G12)>45∣V(G)∣.\gamma_s\left(G^{\frac{1}{2}}\right)>\frac{4}{5}|V(G)|.

The conjecture is motivated by examples showing that the secure domination number of a 22-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.