CTATD Number for power graph of various Ladder Graphs
*G. MahadevanCorresponding authordrgmaha2014@gmail.comDepartment of MathematicsThe Gandhigram Rural Institute (Deemed to be University)Gandhigram, Tamil Nadu, 624302, IndiaView full profile → , K. Priyapriyak250796@gmail.comDepartment of MathematicsThe Gandhigram Rural Institute (Deemed to be University)Gandhigram, Tamil Nadu, 624302, IndiaView full profile → , C. Sivagnanamchoshi71@gmail.comDepartment of MathematicsUniversity of Technology and Applied SciencesSur, Sultanate of OmanView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 May 2025
- Published Online:
- 21 Jul 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2388
- Pages:
- 2699–2709
Abstract
The concept of the CTATD number has been recently further developed, expanding on the original work by Mahadevan, Priya, and Sivagnanam [4]. A subset S ⊆ V is considered a CTATD set for a graph G if for each vertex v ∈ V – S, the intersection of v’s neighborhood with S contains between one and two vertices, and for any set of three vertices in , they must be connected along a path. The smallest size of such a CTATD set is referred to as CTATD(G). This paper specifically focuses on analyzing the CTATD number for various types of graphs, including DLl, O(DLl), TLl, O(TLl), SLl, CLl, MLl, providing explicit values for their CTATD numbers instead of just their bounds.
Keywords
Subject Classifications
References
[1] F. Harary, Graph Theory. Reading, MA, USA: Addison-Wesley (1972).
[2] T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs. New York, USA: Marcel Dekker, Inc., (1998).
[3] M. Chellali, T. W. Haynes, S. T. Hedetniemi, and A. A. McRae, “[1,2]-sets in graphs,” Discrete Applied Mathematics, vol. 161, no. 18, pp. 2885–2893 (Dec. 2013).
[4] G. Mahadevan, K. Priya, and C. Sivagnanam, “Complementary triple connected at most twin domination number of a graph,” Advances and Applications in Mathematical Sciences, vol. 22, no. 8, pp. 1867–1878 (Jun. 2023).
[5] J. Paulraj Joseph, M. K. Angel Jebitha, P. Chithra Devi, and G. Sudhana, “Triple connected graphs,” Indian Journal of Mathematics and Mathematical Sciences, vol. 8, no. 1, pp. 61–75 (2012).
[6] X. Yang and B. Wu, “[1, 2]-domination in graphs,” Discrete Applied Mathematics, vol. 175, pp. 79–86 (Oct. 2014), doi: 10.1016/j.dam.2014.05.035.
[7] K. Priya, G. Mahadevan, C. Sivagnanam, and Sanjay Kumar Tyagi, “CTATD Number for Power Graph of Some Special Graphs and Tadpole Graph,” Discrete Mathematics and Mathematical Modelling, Springer Proceedings in Mathematics and Statistics, vol. 458, pp. 231-239 (2024).
[8] G. Priscilla Pacifica and K. Christy Rani, “Total Restrained detour number of family of ladder graphs,” vol. 20, no. 3A, pp. 34-37 (2022).
[9] M. Joice Punitha and S. Rajakumari, “Skew chromatic index of comb, ladder and Mobius ladder graphs,” International Journal of Pure and Applied Mathematics, vol. 101, no. 6, pp. 1003–1011 (2015), doi: 10.12732/ijpam.v101i6.18.
[10] Doha Adel Abbass, Manal N. Al-Harere, and Emad Bakr Al-Zangana, “On planar domination in graphs,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 28, no. 4-B, pp. 1355-1360 (2025).
[11] T. V. Sateesh Kumar and S. Meenakshi, “Family of Ladder Graphs are Properly Lucky,” Journal of Pharmaceutical Negative Results, vol. 13, Special Issue 3, pp. 1579–1583 (Oct. 2022), doi: 10.47750/pnr.2022.13.S03.243.
[12] S. Meena and G. Gajalakshmi, “Odd Prime Labeling of Graphs Related to Circular Ladder,” Communications in Mathematics and Applications, vol. 13, no. 4, pp. 1307-1315 (2022).
[13] A. Vijayalekshmi and S. Abisha, “Total dominator color class total dominating sets in ladder and Mobius ladder graph,” Malaya Journal of Matematik, vol. 9, no. 1, pp. 1233–1236 (Mar. 2021), doi: 10.26637/MJM0901/0214.
[14] C. Berge, “Theory of graphs and applications,” Methuen, London (1962).
[15] K. Priya, G. Mahadevan, C. Sivagnanam, and S.K. Tyagi, “CTATD Number for Power Graph of Some Special Graphs and Tadpole Graph,” In International Conference on Discrete Mathematics and Mathematical Modelling in Digital Era, pp. 231-239 (2023).
[16] B. Jaya Prasad, T. Tamizh Chelvam, and S. Robinson Chellathurai, “Private domination number of a graph,” Journal of Discrete Mathematical Sciences & cryptography, vol. 10, no. 5, pp. 661-666 (2007).
[17] Adel P. Kazemi, “On the domination number of some graphs,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 12 , no. 4, pp. 489-493 (2009).
[18] Z. Shao, S. M. Sheikholeslami, S. Nazari-Moghaddam, and S. Wang, “Global double Roman domination in graphs,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 22, no. 1, pp. 31-44 (2019).
[19] Ravindra Kumar, Ashutosh Singh, and Om Prakash, “Double Roman domination number of the zero-divisor graphs of commutative rings,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 28, no. 3, pp. 765-781 (2025).
