TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Triple connected certified domination number of triangular grid with boundaries

* , ,

* Corresponding author · click or hover a name for details

pp. 1–14Online FirstJuly 2026DOI: 10.47974/JDMSC-2385 Crossmark XML
Received:
01 May 2025
Published Online:
21 Jul 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2385
Pages:
1–14

Abstract

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.

Keywords

Subject Classifications

05C3805C69

References

[1] J. P. J. Joseph, M. K. A. Jebitha, P. C. Devi, and G. Sudhana, “Triple connected graphs,” Indian Journal of Mathematics and Mathematical Sciences, vol. 8, no. 1, pp. 61–75 (2012).
[2] G. Mahadevan, J. A. Selvam, J. P. J. Joseph, and T. Subramanian, “Triple connected domination number of a graph,” International Journal of Mathematical Combinatorics, vol. 3, pp. 93–104 (2012).
[3] M. Dettlaff, M. Lemańska, J. Topp, R. Ziemann, and P. Żyliński, “Certified domination,” AKCE International Journal of Graphs and Combinatorics, vol. 17, no. 1, pp. 86–97 (2020).
[4] G. Mahadevan, S. Kaviya, and C. Sivagnanam, “Triple connected certified domination in graphs,” Indian Journal of Natural Sciences, vol. 14, no. 80, pp. 63350–63355 (2023).
[5] G. Mahadevan, S. Kaviya, L. Praveenkumar, and S. Anuthiya, “Detection of TCC-domination number for some product-related graphs,” in International Conference on Recent Developments in Mathematics, Cham, Switzerland: Springer, pp. 901–911 (2022).
[6] S. Kaviya, G. Mahadevan, and C. Sivagnanam, “Generalizing TCCD-Number for Power Graph of Some Graphs,” Indian Journal of Science and Technology, vol. 17, Special Issue 1, pp. 115–123 (2024), doi: 10.17485/IJST/v17sp1.243.
[7] S. Varghese, “Domination Problem in Triangular Grids,” IOSR Journal of Mathematics, vol. 19, no. 5, Ser. 2, pp. 41–45 (2023), doi: 10.9790/0661-1905024145.
[8] P. Bose, V. Gledel, C. Pennarun, and S. Verdonschot, “Power domination on triangular grids with triangular and hexagonal shape,” Journal of Combinatorial Optimization, vol. 40, no. 2, pp. 482–500 (2020).
[9] D. C. Jean and S. J. Seo, “Optimal error-detecting open-locating-dominating set on the infinite triangular grid,” Discussiones Mathematicae Graph Theory, vol. 43, no. 2, pp. 445–455 (2023), doi: 10.7151/dmgt.2374.
[10] Q. S. Wang, J. Ye, H. Wu, B. Q. Gao, and P. Shepherd, “A triangular grid generation and optimization framework for the design of free-form gridshells,” Computer-Aided Design, vol. 113, pp. 96–113 (2019).
[11] B. Nagy, “A Khalimsky-like topology on the triangular grid,” in International Conference on Discrete Geometry and Mathematical Morphology, pp. 150–162 (2024).
[12] N. Mani, A. Ilyass, and N. Prasad, “Applications of connected certified domination in wireless sensor networks,” Journal of Information and Optimization Sciences, vol. 46, no. 3, pp. 729–736 (2025).
[13] M. Mehraban and S. Alikhani, “Independent domination bondage number in graphs,” Journal of Information and Optimization Sciences, pp. 1–12 (2025), doi: 10.47974/JIOS-2041.
[14] P. Mafuta, “Radius, diameter, domination number, order and minimum degree,” Journal of Information and Optimization Sciences, vol. 45, no. 5, pp. 1281–1291 (2024).
[15] R. Madan, S. Pathak, R. A. Muneshwar, and K. L. Bondar, “Some results on the open subset intersection graph of a product topological space,” Journal of Information and Optimization Sciences, vol. 44, no. 4, pp. 697–707 (2023).

Views: 21Downloads: 15Citations: 0