Irredundant broadcast equality conjecture for graphs with no strength-one vertices
Statement
Let be a graph. A broadcast has positive-support vertices and strength-one vertices . Write for the minimum cost of an irredundant broadcast on , and for the minimum cost of a dominating broadcast on . Irredundant broadcast equality conjecture. If has an -broadcast such that
then
This is the second conjecture concerning the problem of characterizing graphs for which ; its status is not resolved 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.