Extracting triple connected certified domination number for the strong product of paths and cycles

Abstract

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 is called the triple connected certified domination number (TCCD - number) and is denoted by γT CC (G). The novelty of triple connected certified domination number is which the certified domination holds the triple connected in induced S. The upper bound and loweer bound of γT CC for the given graphs is found and then proved that the upper bound and lower bound of γT CC were equal. This article investigates the TCCD number for the strong product of paths and cycles.