scientific article; zbMATH DE number 3902703

From MaRDI portal
Publication:3680873





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
(64)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680873)