Ghebleh–Niepel conjecture on locating-dominating codes in circulant graphs
Statement
Let be the circulant graph on vertex set in which vertices at cyclic distances or are adjacent. A locating-dominating code is a dominating vertex set whose vertices outside the code have distinct sets of codeword neighbors; let denote the minimum size of such a code. Ghebleh–Niepel's conjecture. If is an integer such that and , then
The paper proves this conjecture, establishing the exact value in the residue classes not covered by the previously known equality .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.