Efficient domination in cubic vertex-transitive graphs

An independent set of vertices S of a graph dominates the graph efficiently if every vertex of the graph is either in S or has precisely one neighbour in S . In this paper we prove that a connected cubic vertex-transitive graph on a power of 2 vertices has a set that dominates it efficiently if and only if it is not isomorphic to a Mِbius ladder.