• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2024, Volume: 17, Issue: Special Issue 1, Pages: 115-123

Original Article

Generalizing TCCD-Number For Power Graph Of Some Graphs

Received Date:29 August 2023, Accepted Date:05 March 2024, Published Date:31 May 2024


Objective: Finding the triple connected certified domination number for the power graph of some peculiar graphs. Methods: A dominating set with the condition that every vertex in has either zero or at least two neighbors in and is triple connected is a called triple connected certified domination number of a graph. The minimum cardinality among all the triple connected certified dominating sets is called the triple connected certified domination number and is denoted by . The upper bound and lower bound of for the given graphs is found and then proved the upper bound and lower bound of were equal. Findings: We found the (TCCD)-number for the power graph of some peculiar graphs. Also, we have generalized the result for path, cycle, ladder graph, comb graph, coconut tree graph, triangular snake, alternate triangular snake, quadrilateral snake and tadpole graph. Novelty: The triple connected certified domination is a new parameter in which the certified domination holds the triple connected in induced .

Keywords: Domination Number, Power Graphs, Triple Connected, Certified Domination, Triple Connected Certified Domination


  1. Mahadevan G, Suganthi MV, Basira AI. Restrained step triple connected domination number of a graph. Journal of Discrete Mathematical Sciences and Cryptography. 2019;22(5):731–744. Available from: https://dx.doi.org/10.1080/09720529.2019.1681690
  2. Dettlaff M, Lemańska M, Topp J, Ziemann R, Żyliński P. Certified domination. AKCE International Journal of Graphs and Combinatorics. 2020;17(1):86–97. Available from: https://dx.doi.org/10.1016/j.akcej.2018.09.004
  3. Mahadevan G, Kaviya S, Sivagnanam C. Triple connected certified domination in graphs. Indian Journal of Natural Sciences. 2023;80:63350–63355. Available from: https://tnsroindia.org.in/JOURNAL/issue80/ISSUE%2080%20-%20OCTOBER%202023%20-%20FULL%20TEXT%2003.pdf
  4. Mahadevan G, Kaviya S, Sivagnanam C, Praveenkumar L, Anuthiya S. Detection of TCC-Domination Number for Some Product Related Graphs. In: Trends in Mathematics. (pp. 901-911) Springer International Publishing. 2024.
  5. Alrikabi ZY, Omran AA. Examining Captive and Inverse Captive Domination in Selected Graphs and Their Complements. Mathematical Modelling of Engineering Problems. 2023;10(5):1763–1769. Available from: https://dx.doi.org/10.18280/mmep.100527
  6. Eakawinrujee P, Trakultraipruk N. γ-Paired dominating graphs of lollipop, umbrella and coconut graphs. Electronic Journal of Graph Theory and Applications. 2023;11(1):65. Available from: https://dx.doi.org/10.5614/ejgta.2023.11.1.6
  7. Kumar TS, Meenakshi S, Lucky. Proper Lucky Labeling of Quadrilateral Snake Graphs. InIOP Conference Series: Materials Science and Engineering. 2021;1085:12039. Available from: https://doi.org/10.1088/1757-899X/1085/1/012039
  8. Chaudhry F, Husin MN, Afzal F, Afzal D, Ehsan M, Cancan M, et al. M-polynomials and degree-based topological indices of tadpole graph. Journal of Discrete Mathematical Sciences and Cryptography. 2021;24(7):2059–2072. Available from: https://dx.doi.org/10.1080/09720529.2021.1984561
  9. Sun D, Zhao Z, Li X, Cao J, Yang Y. On Subtree Number Index of Generalized Book Graphs, Fan Graphs, and Wheel Graphs. Journal of Mathematics. 2021;2021:1–15. Available from: https://dx.doi.org/10.1155/2021/5511214
  10. Anuthiya S, Mahadevan G, Sivagnanam C. Exploration of CPCD number for power graph. Baghdad Science Journal. 2023;20(1(SI)):0380. Available from: https://dx.doi.org/10.21123/bsj.2023.8423
  11. Ma X, Fu R. The Generalized Power Graph of a Finite Group. Journal of Physics: Conference Series. 2019;1237(2):022040. Available from: https://dx.doi.org/10.1088/1742-6596/1237/2/022040


© 2024 Kaviya et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)


Subscribe now for latest articles and news.