The disjoint domination number with a perfect matching is bounded by independence number
Statement
Let be a connected graph containing a swap set. Let denote the minimum size of a disjoint dominating set whose two parts are joined by a perfect matching, and let be the independence number of . Disjoint-domination independence conjecture.
The conjecture asserts the existence of a desired matching between two disjoint dominating sets whose total size is controlled by the independence number. The supplied text does not state whether this conjecture has been resolved.
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.