A short note on the existence of infinite sequences of \(\gamma \)-graphs of graphs (Q2197418)

The \(\gamma\)-graph, \(G(\gamma)\), of a graph \(G\), is the graph whose vertex set is the collection of minimum dominating sets and two such sets are adjacent in \(G(\gamma)\) if they differ by a single vertex and the two different vertices are adjacent in \(G\). The concept was introduced in [\textit{G. H. Fricke} et al., Discuss. Math., Graph Theory 31, No. 3, 517--531 (2011; Zbl 1229.05219)]. The authors correct a mistake from [loc. cit.] by showing that the \(\gamma\)-graph of the Cartesian product \(K_3 \Box K_3\) is not \(K_3 \Box K_3 \Box K_3\). Furthermore, they prove that the \(\gamma\)-graphs of \(K_3 \Box K_3 \Box K_3\) and \(K_3 \Box K_3 \Box K_3 \Box K_3\) are both empty. Their results lead to an interesting question whether there exists a \(\gamma\)-graph sequence of finite graphs that grows without bound on size.