Patrick Boris Willem Blankers

An unbounded gap between domination parameters in two graph products

We refute Conjecture 3 in Davila’s Automated Conjecturing with TxGraffiti, which compares ordinary domination in a direct product with total domination in a Cartesian product. A connected bipartite graph H on twelve vertices satisfies γ(P₅×H)=15 and γₜ(P₅□H)=14. Joining copies gi...