Foucaud–Henning conjecture on location-domination in twin-free graphs
Statement
Let be a graph of order with no isolated vertices. A graph is twin-free if no two distinct vertices have the same open or closed neighborhood, and let be its location-domination number. Foucaud–Henning conjecture. Every twin-free graph of order without isolated vertices satisfies
This is proposed as a strengthening of the Garijo–González–Márquez conjecture and as an analogue of Ore’s one-half bound for the domination number; its status is open.
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.