A dominating set Dof a graph G=(V,E) is called metro dominating set Gif for every pair of vertices u,v there exists a vertex w in D such that d(u,w)≠d(v,w). The k- metro domination number of Cartesian product of of PmPn(γβk(PmPn)), is the order of smallest k- dominating set of PmPn which resolves asa metric set. In this paper we calculate the k- metro domination number of Cartesian product of pmPn
Volume 11 | Issue 1
Pages: 425-431