Garijo, González and Márquez's location-domination conjecture for twin-free graphs
Statement
A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. For a graph , a set of vertices locates a vertex if the neighborhood of within is unique among all vertices in ; a locating-dominating set is a dominating set that locates every vertex outside it. The location-domination number is the minimum cardinality of a locating-dominating set. The order of a graph is its number of vertices.
Garijo, González and Márquez's conjecture. There exists an integer such that for any , the maximum value of the location-domination number of a connected twin-free graph of order is .
This conjecture asserts that, for sufficiently large connected twin-free graphs, the location-domination number obeys the same one-half-order upper bound as the classical domination number. The source does not give evidence that it 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.