A dominating set S of a graph G is said to be a triple connected certified dominating set (TCCD - set) if for every vertex v ∈ S, | N(v) ∩ (V − S) | ≠ 1 and ⟨S⟩ is triple connected. The minimum cardinality of a TCCD - set ...