On Cayley graphs of semilattices of semigroups. (Q1941756): Difference between revisions

Let \(S=\bigcup_{\alpha\in Y}S_\alpha\) be a semilattice of semigroups and \(C\subseteq S\). The authors investigate the color automorphism vertex-transitivity of the Cayley graph \(\text{Cay}(S,C)\), and show that under a Condition * on this graph, the behavior of the Cayley graph \(\text{Cay}(S,C)\) is essentially related to the properties of the Cayley graph \(\text{Cay}(Y,D)\), where \(D=\{a\in Y\mid \exists c\in C\): \(c\in S_a\}\). Because of this, first they study the Cayley graph \(\text{Cay}(T,D)\), where \(T\) is a semilattice and \(D\subseteq T\), and give some descriptions for semilattice graphs. Then these results are used to characterize the color automorphism vertex-transitive Cayley graphs of semilattices of semigroups under the Condition *. One result for finite \(S_\alpha\) and a non-empty \(C\subseteq S_1\) is the following equivalence: (i) \(\text{Cay}(S,C)\) is \(\text{ColAut}_S(C)\)-vertex-transitive; (ii) for every \(\alpha\in Y\), \(S_\alpha\) is a simple \(\langle C\rangle\)-act and the graph \(G(S_1,C_1)\) in \(\text{Cay}(S,C)\) is \(\text{ColAut}_{C_1}(S_1)\)-vertex-transitive.