ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs with an identified vertex vv. Write G\,\makebox[0ex][l]{+} \raisebox{-.75ex}{\makebox[2ex]{_{v}}}\,H for their vertex sum at vv. Suppose that Z(G)=P(G)Z(G)=P(G) and Z(H)=P(H)Z(H)=P(H). 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 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.