A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The chessboard domination problems were said to be origin of the study of graphs. The n 2 cells in the chessboard of order ݊ × ݊ are treated as vertices and two vertices are adjacent if one can cover the other vertex in one move directly. Various studies had been done on these chessboard problems in relation to different domination parameters such as domination, independence and irredundance on queens, bishops, kings and rooks graphs. In this paper we extend this study on perfect domination anddoi:10.22457/apam.v18n1a8 fatcat:5si26pymojdc7l43tcwge3mc3q