Characterizing Cartesian fixers and multipliers

Abstract

Let G H denote the Cartesian product of the graphs G and H. In 2004, Hartnell and Rall [On dominating the Cartesian product of a graph and K 2 , Discuss. Math. Graph Theory 24(3) (2004), 389-402] characterized prism fixers, i.e., graphs G for which γ(G K 2) = γ(G), and noted that γ(G K n) ≥ min{|V (G)|, γ(G)+ n− 2}. We call a graph G a consistent fixer if γ(G K n) = γ(G) + n − 2 for each n such that 2 ≤ n < |V (G)| − γ(G) + 2, and characterize this class of graphs. Also in 2004, Burger, Mynhardt and Weakley [On the domination number of prisms of graphs, Dicuss. Math. Graph Theory 24(2) (2004), 303-318] characterized prism doublers, i.e., graphs G for which γ(G K 2) = 2γ(G). In general γ(G K n) ≤ nγ(G) for any n ≥ 2. We call a graph attaining equality in this bound a Cartesian n-multiplier and also characterize this class of graphs.