Irredundant broadcast equality conjecture for graphs with no strength-one vertices
Let GGG be a graph. A broadcast fff has positive-support vertices Vf+={v∈V(G):f(v)>0}V_f^+=\{v\in V(G):f(v)>0\}Vf+={v∈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\}Vf1={v∈V(G):f(v)=1}. Write…
MathDB