Zero forcing and path number under vertex sums
Statement
Let and be graphs with an identified vertex . Write G\,\makebox[0ex][l]{+} \raisebox{-.75ex}{\makebox[2ex]{_{v}}}\,H for their vertex sum at . Suppose that and . Vertex-sum conjecture. Then
Z(G\,\makebox[0ex][l]{$+$} \raisebox{-.75ex}{\makebox[2ex]{$_{v}$}}\,H)=P(G\,\makebox[0ex][l]{$+$} \raisebox{-.75ex}{\makebox[2ex]{$_{v}$}}\,H).This proposed closure property would provide a larger family of graphs for which the zero forcing number equals the path number, extending the known examples of block-cycle graphs. The source presents it as a problem for further study; its resolution is not given here.
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.