Independent domination conjecture for Cartesian products
Statement
Let and be undirected graphs. Write for the domination number of a graph, and let denote its independent domination number, the smallest size of an independent dominating set of . The Cartesian product has vertex set . The independent domination conjecture.
This is an analogue of Vizing's conjecture for independent domination and would imply Vizing's conjecture. The stronger product inequality is known to fail for some graphs, so this formulation avoids that obstruction; its resolution is not supplied in the source.
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.