The location-domination conjecture for twin-free graphs
Statement
Let be a graph on vertices. A twin-free graph is one with no two distinct vertices having the same open neighborhood, and denotes its location-domination number.
Location-domination conjecture. If is a twin-free graph on vertices, then
This conjecture, due to Garijo, González and Márquez, concerns the size of a smallest locating-dominating set in a twin-free graph. The source proves the weaker bound , improving the earlier bound , so the conjectured bound remains open in the supplied source.
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.