Open Access
Research Article·pp. 2773–2786·Vol. 29, Issue 7Jul 2026
Triple connected certified domination number of triangular grid with boundaries
S. Kaviya, G. Mahadevan, C. Sivagnanam
Published Online: 21 Jul 2026DOI: 10.47974/JDMSC-2385
In this paper: 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...
