[1] Cockayne, E. J., Dawes, R. M., Hedetniemi, S. T. (1980). Total domination in graphs. Networks, 10(3), 211-219. 
[2] Cockayne, E. J., Dreyer Jr, P. A., Hedetniemi, S. M., Hedetniemi, S. T. (2004). Roman domination in graphs. Discrete mathematics, 278(1-3), 11-22. 
[3] Haynes, T. W., Hedetniemi, S., Slater, P. (2013). Fundamentals of domination in graphs. CRC press. 
[4] Harary, F. (1969). Graph Theory. Addison Wesley Publishing Company. Reading, Massachusetts. 
[5] Henning, M. A., Yeo, A. (2013). Total domination in graphs. New York: Springer. 
[6] Mycielski, J., (1955). Sur le coloriage des graphes. Colloq. Math.3(2): 161162. 
[7] Sampathkumar, E., Walikar, H. B. (1979). The connected domination number of a graph. J. Math. Phys, 13(6). 
[8] Thilakan, K., Kuriakose, R., Parvathy, K. S. (2025). Valency-Based Domination Number. Asian-European Journal of Mathematics, 2540003.
[9] Jafari, H., Salehfard, S., Aqababaei Dehkordi, D. (2024). Introducing a simple method for detecting the path between two different vertices in the Graphs. Mathematics and Computational Sciences, 4(4), 10-16. 
[10] Taati, M. (2025). Introduction of some one-searchable graphs. Mathematics and Computational Sciences, 6(2), 72-76. 
[11] Lekha, A. , Parvathy, K., & Arumugam, S. (2026). Strength based domination in graphs. Communications in Combinatorics and Optimization, 11(1), 145-154. 
[12] Deepa, V. G., Lakshmanan, S. A., & Sreeja, V. N. (2024). Identification of Optimum Public EV Charging Stations. In Optimization Techniques and Associated Applications, 36-41, CRC Press.