Claw-free regular-graph conjecture for generalized power domination
Statement
For all integers , every connected claw-free -regular graph of order satisfies , where denotes the generalized -power domination number of . The bound is sharp.
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.