Garijo et al.'s locating-dominating set conjecture for twin-free graphs
Statement
Let be a twin-free graph of order without isolated vertices. A locating-dominating set is a dominating set such that every two distinct vertices outside have distinct neighborhoods in ; let denote the minimum cardinality of a locating-dominating set of .
Garijo et al.'s conjecture. Every twin-free graph of order without isolated vertices satisfies
This conjecture proposes a universal upper bound on the locating-dominating number of twin-free graphs. The supplied source does not indicate whether the 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.