ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A broadcast ff has positive-support vertices Vf+={v∈V(G):f(v)>0}V_f^+=\{v\in V(G):f(v)>0\} and strength-one vertices Vf1={v∈V(G):f(v)=1}V_f^1=\{v\in V(G):f(v)=1\}. Write ir⁡b(G)\operatorname{ir}_{b}(G) for the minimum cost of an irredundant broadcast on GG, and γb(G)\gamma_b(G) for the minimum cost of a dominating broadcast on GG. Irredundant broadcast equality conjecture. If GG has an ir⁡b\operatorname{ir}_{b}-broadcast ff such that

f(v)≥2for all v∈Vf+,f(v)\geq 2\quad\text{for all }v\in V_f^+,

then

ir⁡b(G)=γb(G).\operatorname{ir}_{b}(G)=\gamma_b(G).

This is the second conjecture concerning the problem of characterizing graphs for which γb=ir⁡b\gamma_b=\operatorname{ir}_b; 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 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.