ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices. A twin-free graph is one with no two distinct vertices having the same open neighborhood, and LD(G)LD(G) denotes its location-domination number.

Location-domination conjecture. If GG is a twin-free graph on nn vertices, then

LD(G)≤n2.LD(G)\leq \frac{n}{2}.

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 LD(G)≤⌈58n⌉LD(G)\leq \lceil\frac{5}{8}n\rceil, improving the earlier bound ⌊23n⌋\lfloor\frac{2}{3}n\rfloor, 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 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.