On the $k$-dominating number of Cartesian products of two paths
Antoaneta Klobučar · Czech digital mathematics library · 2005
A subset D c V(G) is called a k-dominating set, k > 1, if for every vertex y not in D, there exists at least one vertex x G D such that d(x,y) m -1 and lim 7fc ^ ™------where P n denote the path of length n.Domination numbers of Cartesian products were intensively investigated in the past (see e.g.[1], [2], [5], [6], [10]).In this paper we extend these investigations to k-domination for k > 2.