Automorphism groups of wreath product digraphs (Q1010922)

Summary: We generalize a classical result of Sabidussi that was improved by Hemminger, to the case of directed color graphs. The original results give a necessary and sufficient condition on two graphs, \(C\) and \(D\), for the automorphism group of the wreath product of the graphs, \(\text{Aut}(C\wr D)\) to be the wreath product of the automorphism groups \({\text{Aut}}(C)\wr {\text{ Aut}}(D)\). Their characterization generalizes directly to the case of color graphs, but we show that there are additional exceptional cases in which either \(C\) or \(D\) is an infinite directed graph. Also, we determine what \({\text{Aut}}(C \wr D)\) is if \({\text{Aut}}(C \wr D) \neq {\text{Aut}} (C) \wr {\text{Aut}} (D)\), and in particular, show that in this case there exist vertex-transitive graphs \(C'\) and \(D'\) such that \(C' \wr D' = C \wr D\) and \({\text{Aut}} (C\wr D) = {\text{Aut}} (C') \wr {\text{Aut}}(D')\).