Domination numbers of cardinal products
Antoaneta Klobučar · Czech digital mathematics library · 1999
For a graph G a subset D of the vertex-set of G is called domi nating set if every vertex x not in D, is adjacent to at least one vertex of D. The domination number 7(C) is the cardinality of the smallest dominating set.Here we determine the domination numbers of P 2 x P n , P 3 x P n , P 4 x P n , and P 5 x P n where x denotes the cardinal product. l(C n ) = l(P n ) = [f J •AMS Subject Classification (1991): Primary 05C38.