ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a twin-free graph of order nn without isolated vertices. A locating-dominating set is a dominating set DD such that every two distinct vertices outside DD have distinct neighborhoods in DD; let gammaL(G)gamma_L(G) denote the minimum cardinality of a locating-dominating set of GG.

Garijo et al.'s conjecture. Every twin-free graph GG of order nn without isolated vertices satisfies

γL(G)≤n2.\gamma_L(G)\leq \frac{n}{2}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.