ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a digraph of order nn. Write δ0\delta^{0} for its minimum semidegree, and let γoso(D)\gamma_{oso}(D) and γiso(D)\gamma_{iso}(D) denote its open secure out-domination and secure in-domination numbers, respectively. Secure domination conjecture. If

δ0≥1,\delta^{0}\geq 1,

then

γoso(D)≤⌈2n3⌉andγiso(D)≤⌈2n3⌉.\gamma_{oso}(D)\leq \left\lceil\frac{2n}{3}\right\rceil\qquad\text{and}\qquad\gamma_{iso}(D)\leq \left\lceil\frac{2n}{3}\right\rceil.

This conjecture proposes sharp upper bounds for two secure domination parameters in digraphs with minimum semidegree at least one; the source presents it as an open conjecture.

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.