A set of vertices Dc in a connected graph Γ = (VΓ, EΓ) is called a certified dominating set if |NΓ(u) ∩ (VΓ − Dc)| is either 0 or at least 2, ∀u ∈ Dc. The set Dc is called as connected certified dominating set if |N(u) ∩ ...