 Thus, the domination number of this graph is formula_4 far higher than the trivial bound of one given by Vizing's conjecture.There exist infinite families of graph products for which the bound of Vizing's conjecture is exactly met.For instance, if "G" and "H" are both connected graphs, each having at least four vertices and having exactly twice as many total vertices as their domination numbers, then formula_5.