The secure domination conjecture for digraphs with minimum semidegree at least one
Statement
Let be a digraph of order . Write for its minimum semidegree, and let and denote its open secure out-domination and secure in-domination numbers, respectively. Secure domination conjecture. If
then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.