ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. For a graph GG, a set DD of vertices locates a vertex v∉Dv\notin D if the neighborhood of vv within DD is unique among all vertices in V(G)∖DV(G)\setminus D; a locating-dominating set is a dominating set that locates every vertex outside it. The location-domination number γL(G)\gamma_L(G) 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 n1n_1 such that for any n≥n1n\geq n_1, the maximum value of the location-domination number of a connected twin-free graph of order nn is ⌊n2⌋\lfloor\frac{n}{2}\rfloor.

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 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.