Italian domination conjecture for the Cartesian product of a 4-cycle and an odd cycle
Statement
Let be the cycle on an odd integer , and let denote their Cartesian product. For an Italian dominating function on a graph, assign each vertex a value in so that every vertex assigned has neighboring assigned values with sum at least ; let be the minimum weight of such a function. Italian domination conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.