Total and paired domination numbers of some wheel-related graphs

Document Type : Research Paper

Authors

1 Thammasat Secondary School, Faculty of Learning Sciences and Education, Thammasat University, Pathum Thani 12120, Thailand

2 Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University, Pathum Thani 12120, Thailand

Abstract

Let $G$ be a graph without isolated vertices. A total dominating set of $G$ is a set $D\subseteq V(G)$ such that every vertex of $G$ is adjacent to some vertex in $D$. A paired dominating set of $G$ is a total dominating set whose induced subgraph has a perfect matching. The total (paired) domination number of $G$ is the minimum cardinality of a total (paired) dominating set of $G$. In this paper, we determine the total and the paired domination numbers of some wheel-related graphs. We also give upper bounds on the total and the paired domination numbers of closed helm graphs and web graphs. Moreover, we determine the paired domination numbers of Jahangir graphs and correct some results on the total domination numbers presented by Mtarneh et al. (Malays. J. Math. Sci., 13(S) (2019) 113--121).

Keywords

Main Subjects


[1] S. Bermudo, Total domination on tree operators, Mediterr. J. Math., 20 no. 1 (2023) 16 pp.
[2] X. G. Chen, M. Y. Sohn and Y. F. Wang, Total domination number of central trees, Bull. Korean Math. Soc., 57 no. 1 (2020) 245–250.
[3] E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, Total domination in graphs, Networks, 10 no. 3 (1980) 211–219. [4] P. Eakawinrujee, Total and paired domination numbers of cylinders, Bull. Malays. Math. Sci. Soc., 45 no. 6 (2022) 3321–3334.
[5] P. Eakawinrujee and N. Trakultraipruk, γ-paired dominating graphs of lollipop, umbrella, coconut graphs, Electron. J. Graph Theory Appl. (EJGTA), 11 no. 1 (2023) 65–79.
[6] P. Eakawinrujee and N. Trakultraipruk, Total and paired domination numbers of windmill graphs, Asian-Eur. J. Math., 16 no. 7 (2023) 14 pp.
[7] S. Gravier, Total domination number of grid graphs, Discrete Appl. Math., 121 no. 1-3 (2002) 119–128.
[8] T. W. Gravier and P. J. Slater, Paired-domination in graphs, Networks, 32 no. 3 (1998) 199–206.
[9] M. A. Henning, Graphs with large total domination number, J. Graph Theory, 35 no. 1 (2000) 21–45.
[10] F. T. Hu, M. Y. Sohn and X. G. Chen, Total and paired domination numbers of Cm bundles over a cycle Cn, J. Comb. Optim., 32 no. 2 (2016) 608–625.
[11] F. T. Hu and J. M. Xu, Total and paired domination numbers of toroidal meshes, J. Comb. Optim., 27 no. 2 (2014) 369–378.
[12] F. Kazemnejad and S. Moradi, Total domination number of central graphs, Bull. Korean Math. Soc., 56 no. 4 (2019) 1059–1075.
[13] F. Kazemnejad, B. Pahlavsay, E. Palezzato and M. Torielli, Total domination number of middle graphs, Electron. J. Graph Theory Appl., 10 no. 1 (2022) 275–288.
[14] A. Klobuˇcar, Total domination number of Cartesian products, Math. Commun., 9 no. 1 (2004) 35–44.
[15] A. Klobuˇcar and A. Klobuˇcar, Total and double total domination number on hexagonal grid, Mathematics, 7 no. 11 (2019) 1110.
[16] D. A. Mojdeh and A. N. Ghameshlou, Domination in Jahangir graph J2,m, Int. J. Contemp. Math. Sci., 2 no. 24 (2007) 1193–1199.
[17] D. A. Mojdeh and M. H. L. Badakhshian, Total and connected domination in chemical graphs,Ital. J. Pure Appl. Math., N39 (2018) 393–401.
[18] D. A. Mojdeh, S. R. Musawi, E. N. Kiashi and N. J. Rad, Total domination in cubic Kn¨odel graphs, Commun. Comb. Optim., 6 no. 2 (2021) 221–230.
[19] S. Mtarneh, R. Hasni, M. H. Akhbari and F. Movahedi, Some domination parameters in generalized Jahangir graph Jn,m, Malays. J. Math. Sci., 13(S) (2019) 113–121.
[20] K. E. Proffitt, T. W. Haynes and P. J. Slater, Paired-domination in grid graphs, Congr. Numer., 150 (2001) 161–172. [21] J. M. Sigarreta, Total domination on some graph operators, Mathematics, 9 no. 3 (2021) 241.
Volume 15, Issue 4 - Serial Number 4
December 2026
Pages 251-272
  • Receive Date: 31 May 2025
  • Revise Date: 18 November 2025
  • Accept Date: 15 November 2025
  • Published Online: 29 November 2025