Reversible zero forcing
Statement
For and a graph , determine the minimum number of elements in a set so that such a propagation process covers the vertices of .
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.