On graphs having domination number half their order
There is known the conjecture of V. G. Vizing that \(\sigma\) (G\(\times H)\geq \sigma (G)\cdot \sigma (H)\), \(\sigma\) (G) being the domination number of graph G; though the authors have no solution to this open problem, they present a class of connected graphs of order 2n with domination number n, with the property that \(\sigma (G\times H)=\sigma (G)\cdot \sigma (H)\) for every two graphs G and H in this class.
scientific article; zbMATH DE number 3970792