Answers are grounded in this paper and cite their sources.
Let D be a proper subset of Zₙ such that $|D|$ divides n and is relatively prime to n/|D|. We first establish a necessary and sufficient condition for D to be an efficient dominating set of some circulant graph (Zₙ,S). Moreover, for an inverse-closed subset S of Zₙ\0\ such that $|S|+1$ divides n and is relatively prime to n/|S|+1, we give a necessary and sufficient condition for the existence of efficient dominating sets in (Zₙ,S). We also obtain some results about the set of all efficient dominating sets in any circulant graph. Similar results for efficient open dominating sets are also obtained. These results extend some theorems in [Discrete Math. 340 (2017) 1503--1507], [Discrete Math. 340 (2017) 1522--1527], and [Des. Codes Cryptogr. 94 (2026), 87].
No takes yet. Share an insight, caveat, or question.
Deng et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: