Anwar  Nsaif Jasim, 
    On Total Domination Concept in Chessboard,
    Journal of Engineering and Applied Sciences,
    Volume 14,Issue 18,
    2019,
    Pages 6758-6763,
    ISSN 1816-949x,
    jeasci.2019.6758.6763,
    (https://makhillpublications.co/view-article.php?doi=jeasci.2019.6758.6763)
    Abstract: The chessboard 8×8 is consists 64 squares. It was converted into a graph G = (V, E) with 64 vertices
which any two vertices are adjacent by edge. The problem of dominating of the chessboard located within the
subjects related to the entertainment mathematics or the puzzles in mathematics. The problem of dominating
of the chessboard is to place a certain number of pieces on the chessboard. Let u, vεV, u is the location of the
piece and v is the location to move it, the movement of the piece of chessboard from u to v is the distance
between u and v, i.e., d(u, v) = 1. In this study, we applied the domination concept and total domination concept
in chessboard pieces (Rook , Bishop, King, Knight and queen). We found graphs for each piece.
    Keywords: dominating;chessboard;total domination;domination;Graph theory;puzzles