Efficient open domination in Cayley graphs

Efficient open dominating sets in bipartite Cayley graphs are characterized in terms of covering projections. Necessary and sufficient conditions for the existence of efficient open dominating sets in certain circulant Harary graphs are given. Chains of efficient dominating sets, and of efficient open dominating sets, in families of circulant graphs are described as an application.