The γ-graph of a graph For a graph G = (V, E), the γ-graph of G, G(γ) = (V (γ), E(γ)), is the reconfiguration graph whose vertex set is the collection of minimum dominating sets, or γ-sets of G, and