A dominating set S in a graph G is termed a Triple Connected Certified Dominating Set (TCCD-set) if, for each vertex v in S, either the number of neighbors of v in V – S is zero or k where k ≥ 2, and any three vertices of S are positioned on a path within the subgraph induced by S. The minimum size of a TCCD-set is known as the Triple connected certified domination Number (TCCD-number) and is symbolized as γTCC (G). This study explores the TCCD number for triangular grid of rectangular and square border.