Davila–Henning zero-forcing conjecture for cubic graphs and total domination

Let GG be a connected cubic graph other than K4K_4. Let Z(G)Z(G) be its zero forcing number and let γt(G)\gamma_t(G) be its total domination number.

Davila–Henning zero-forcing conjecture.

Z(G)32γt(G),Z(G)\leq\frac{3}{2}\gamma_t(G),

and this bound is sharp.

The source states that this conjecture was verified by Davila and Henning.

Sources & referencesView supporting material

Primary source

Randy Davila, “Advancements in Research Mathematics through AI: A Framework for Conjecturing”, arXiv:2306.12917 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.