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. An identifying code is a dominating vertex set whose closed neighborhoods intersected with the code are distinct for all vertices; let γID(Cn(1,3))\gamma^{ID}(C_n(1,3)) denote the minimum size of such a code. Ghebleh–Niepel's conjecture. If nn is an integer such that n≥19n \geq 19 and n≡8(mod11)n \equiv 8 \pmod{11}, then

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

The paper proves this conjecture and, more broadly, determines the exact identifying-code number for all n≥11n\geq 11, including additional residue classes for sufficiently large nn.

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.