Weighted independence-domination inequality
Statement
Let and be graphs on the same vertex set . For a weight function , let
and let denote the weighted collective domination number for the system .
Weighted independence-domination inequality. For every weight function ,
The statement is presented as a possible weighted extension of an earlier independence-domination theorem. The supplied text gives no resolution status.
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.