Efficient domination in cubic vertex-transitive graphs

► We study efficiently dominated vertex-transitive cubic graphs. ► Up to a Möbius ladder, every vertex-transitive cubic graph on 2n vertices admits efficient domination. ► We apply algebraic approach to domination in graphs.