Title of article
Domination number of the cross product of paths Original Research Article
Author/Authors
Rachid Chérifi، نويسنده , , Sylvain Gravier and Julien Moncel، نويسنده , , Xavier Lagraula، نويسنده , , Charles Payan، نويسنده , , Ismaïl Zighem، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
39
From page
101
To page
139
Abstract
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.
Journal title
Discrete Applied Mathematics
Serial Year
1999
Journal title
Discrete Applied Mathematics
Record number
884920
Link To Document