Jacobson, M. S.; Kinch, L. F. On the domination number of products of graphs. I. (English) Zbl 0566.05050 Ars Comb. 18, 33-44 (1984). In this paper we consider a problem of Cockayne, to determine a relationship between the domination number of a graph product versus the product of the domination numbers. For some very special cases we show, in fact, that \[ (1)\quad \sigma (G\times H)\geq \sigma (G)\cdot \sigma (H), \] where \(\sigma\) (F) is the domination number of the graph F. This paper supports the conjecture that statement (1) is true for all graphs G and H. Cited in 5 ReviewsCited in 51 Documents MSC: 05C99 Graph theory Keywords:domination number; graph product PDFBibTeX XMLCite \textit{M. S. Jacobson} and \textit{L. F. Kinch}, Ars Comb. 18, 33--44 (1984; Zbl 0566.05050) Online Encyclopedia of Integer Sequences: The domination number of the 4 X n board.