Domination number of the cross product of paths Original Research Article

The problem of determining the domination number of an arbitrary grid graph is known to be NP-complete, but the complexity of the same problem on complete grid graphs is still unknown. In the present paper we study the same problem on a similar grid graph defined by the cross product of two paths pk and Pn.