The endomorphism monoids and automorphism groups of Cayley graphs of semigroups (Q1677268)

The main result is the following: Let \(S\) be a monoid and \(C\) be a generating set of \(S\). Then the quotient group \(\mathrm{CPAut}_C(S)/\mathrm{ColAut}_C(S)\) is isomorphic to \(\Aut(S,C)\). Here, a graph endomorphism \(\varphi\) of \(\mathrm{Cay}(S,C)\), is called a color-permutable endomorphism of \(\mathrm{Cay}(S,C)\), if there exists \(\gamma\in C^C\) such that for every \(s\in S\) and \(c\in C\), \(\varphi(cs)=\gamma(c)\varphi(s)\). On the way, the author shows that for a monoid \(S\) with generating system \(C\) the following concepts coincide: \(\mathrm{Cay}(S,C)\) is color-vertex-transitive; \(\mathrm{Cay}(S,C)\) is color-permutable vertex-transitive; \(\mathrm{Cay}(S,C)\) is vertex-transitive; \(\mathrm{Cay}(S,C)\) is \(\mathrm{ColEnd}_C(S)\)-vertex-transitive; \(S\) is a group. By an example it is shown that \(\mathrm{CPEnd}_C(S)\)-vertex-transitivity is not equivalent to \(\mathrm{ColEnd}_C(S)\)-vertex-transitivity. In [Houston J. Math. 45, No. 1, 55--69 (2019; Zbl 1479.05144)], the author et al. give a monoid \(S\) and a subset \(C\) of \(S\), which apparently is not generating, such that \(\mathrm{Cay}(S,C)\) is \(\mathrm{ColAut}_C(S)\)-vertex-transitive but not isomorphic to a group graph. Also a vertex-transitive graph is given that is not isomorphic to a vertex-transitive monoid graph. Finally, edge and arc transitivities are discussed and related to vertex transitivities.