On the Total Domination and Vertex Covering of the Standard Chessboard

Anwar Nasif Jasim

doi:10.31185/wjps.523

Authors

Anwar Nasif Jasim Department of Mathematics, Faculty of Computer Science and Mathematics, University of Kufa, IRAQ

DOI:

https://doi.org/10.31185/wjps.523

Keywords:

Graph theory, Chessboard, Domination, Total domination, Cover vertex.

Abstract

The movement of pieces on chessboards has led to several problems. Many researchers have solved some of these problems, but many of them remain unsolved. Graph theory is a mathematical method used to describe and discover solutions to such problems. The problem of dominating the chessboard was found in topics pertaining to puzzles in mathematics and entertainment mathematics. In this paper, we survey some results concerning parameters domination, total domination, and covering vertices in chessboard. After converting the chessboard to graph.

References

A. N. Jasim and A. A. Najim, Solving Edges Deletion Problem of Complete Graphs, Baghdad Science Journal, 2024.

A. N. Jasim and A. A. Najim, Solving Edges Deletion Problem of Generalized Petersen Graphs, Journal of Kufa for Mathematics and Computer, vol 11, no 1, pp. 6-10, 2024.

A. N. Jasim and A. A. Najim, Edges deletion problem of hypercube graphs for some n, Discrete Mathematics, Algorithms and Applications, page 2450045, 2024.

H. R. Hashim, F. Luca, H. B. Shelash, and A. A. Shukur, Generalized lucas graphs, Afrika Matematika, vol. 34, no. 1, p.10, 2023.

K. Johnson, On the Domination Chain of m×n Chess Graphs, (Master's thesis, Murray State University), 2018.

M. Laisin, O. C. Okoli, E. I. Chukwuma and C. A. Okaa-Onwuogu, Construction of a three-dimensional chess board for bishop movement within the forbidden area with vector directives, World J Innov Res, vol. 9, no. 1, pp. 101-105, (2020).

K. H. Zurange, Professional AI Chess Board Autonomous Chess Board (Human Vs. Robot). IJERT, vol. 9, pp. 135-138, 2020.

E. J. Cockayne, Chessboard domination problems. Discrete Mathematics, vol. 86, no. 3, pp 13-20, 1990.

P. Gupta, Domination in graph with application, Indian J. Res, vol. 2, no.3, pp. 115-117 , 2013.

J. Eade, Chess for dummies, John Wiley & Sons, 2016.

K. Suja and K. Vishwanathan, Split domination of some special graph, In AIP Conference Proceedings, vol. 2516, no. 1, 2022.

J. M. Tarr, Domination in graphs, 2010.

J. Hassan, J., M. A. O. Bonsocan, R. A. Rasid and A. S. S. Sappari, Certified Vertex Cover of a Graph, European Journal of Pure and Applied Mathematics, vol.17, no.2, pp. 1038-1045, 2024.

F. Panolan and H. Yaghoubizade, Partial vertex cover on graphs of bounded degeneracy, In International Computer Science Symposium in Russia, pp. 289-301, 2022.

J. C. White, A mathematical analysis of the game of chess, 2018.

G. Mahalingam, Connected domination in graphs (Doctoral dissertation, University of South Florida), 2005.

G. Chartrand and P. Zhang, A chessboard problem and irregular domination, Bull. Inst. Combin. Appl, vol. 98, pp. 43-59, 2023.

W. Goddard and M. A. Henning, Independent domination in graphs: A survey and recent results, Discrete Mathematics, vol. 313, no.7, pp. 839-854, 2013.

S. Seinn, Relations Between SomePieces in The Game of Chess and Some Properties of Graphs (Doctoral dissertation, MERAL Portal), 2016.

T. W. Haynes, S. T. Hedetniemi and & M. A. Henning, Topics in domination in graphs (Vol. 64), Cham: Springer. Journal of Applied Engineering Research, vol. 10, no.16, pp. 36169 – 36174, 2020.

G.B. EKİNCİ, J.B. Gauci, The diameter vulnerability of the generalized Petersen graph {GP [tk,k]}, Turkish Journal of Mathematics, vol.42, no.6, pp. 2897–2915, 2018.