ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cn(1,3)C_n(1,3) be the circulant graph on vertex set Zn\mathbb{Z}_n in which vertices at cyclic distances 11 or 33 are adjacent. A locating-dominating code is a dominating vertex set whose vertices outside the code have distinct sets of codeword neighbors; let γLD(Cn(1,3))\gamma^{LD}(C_n(1,3)) denote the minimum size of such a code. Ghebleh–Niepel's conjecture. If nn is an integer such that n≥13n \geq 13 and n≡2,3,5(mod6)n \equiv 2,3,5 \pmod{6}, then

γLD(Cn(1,3))=⌈n/3⌉+1.\gamma^{LD}(C_n(1,3))=\lceil n/3\rceil+1.

The paper proves this conjecture, establishing the exact value in the residue classes not covered by the previously known equality γLD(Cn(1,3))=⌈n/3⌉\gamma^{LD}(C_n(1,3))=\lceil n/3\rceil.

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.