On the 2-Domination Number of Complete Grid Graphs
Ramy Shaheen, Suhail Mahfud, Khames Almanea · Open Journal of Discrete Mathematics · 2017
, is the order of a smallest k-dominating set of G.In this paper we calculate the k-domination number (for k = 2) of the product of two paths P m × P n for m = 1, 2, 3, 4, 5 and arbitrary n.These results were shown an error in the paper [1].