Let G be a graph. A dominating set D ⊆ V (G) is a super dominating set if for every vertex x ∈ V (G) \ D there exists y ∈ D such that NG (y) ∩ (V (G) \ D)) = {x}. The cardinality of a smallest super dominating set of G is ...