Domination–packing inequality γ(G)≤2ρ(G)+1
Statement
For every connected graph with maximum degree , the domination number satisfies , where is the maximum cardinality of a set of vertices whose pairwise distances are at least .
Record
- Added
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.