  We define the type of graph products, which enable us to treat many graph
products in a unified manner. These unified graph products are shown to be
compatible with Godsil--McKay switching. Furthermore, by this compatibility, we
show that the Doob graphs can also be obtained from the Hamming graphs by
switching.
