ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the cycle on an odd integer nn, and let C4□CnC_4\square C_n denote their Cartesian product. For an Italian dominating function on a graph, assign each vertex a value in {0,1,2}\{0,1,2\} so that every vertex assigned 00 has neighboring assigned values with sum at least 22; let γI\gamma_I be the minimum weight of such a function. Italian domination conjecture.

γI(C4□Cn)=2n+2.\gamma_I(C_4\square C_n)=2n+2.

The paper determines exact values for several Cartesian products of cycles, while the cases not covered by those results remain open; this conjecture addresses the case of a 4-cycle and an odd cycle.

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.