Generalized Cayley graphs over hypergroups and their graph product (Q6983291)

A polygroup is an algebraic structure \((P,\cdot, 1,()^{-1})\), where ``\(\cdot\)'' is a hyperoperation on \(P, 1\in P\), \(( )^{-1}\) is a unary operation on \(P\) which satisfies three axioms below, for all \(x, y, z\in P\):\N\N(i) \((x \cdot y) \cdot z = x \cdot (y \cdot z)\), (ii) \(1 \cdot x = x \cdot 1 = x\) and (iii) \(x\in y \cdot z\) implies that \(y \in x \cdot z^{-1}\) and \(z\in y^{-1}\cdot x\).\N\N\textit{D. Heidari} et al. [Commun. Algebra 47, No. 5, 2209--2219 (2019; Zbl 1476.20064)] associated a graph \(\mathrm{GCG}(P;S)\) to a polygroup \(P\) and a non-empty subset \(S\) of \(P\) with \(S=S^{-1}\), called generalized Cayley graph over \(P\) and then studied some of its properties. Following this idea, in this paper, the authors introduce generalized Cayley graphs over \textit{hypergroups}. They show that, among other things, if \(H_1\) and \(H_2\) are two hypergroups with connection sets \(S_1\) and \(S_2\), respectively and suppose that \(a\not\in S_1 a\) and \(b\not\in S_2 b\) for all \(a \in H_1, b\in H_2\), then\N\[\N\mathrm{GCG}(H_1 \times H_2; S_1 \times S_2) = \mathrm{GCG}(H_1; S_1) \times \mathrm{GCG}(H_2; S_2)\N\]\Nwhere the right-hand-side product is the tensor product of the graphs.