On characterization of a completely simple semigroup by its power graph and Green relations (Q2141081)

Characterizing groups by graphs corresponded to them is a popular research area in group theory. It means that if the corresponding graphs of two groups are isomorphic, then the groups are isomorphic. For example, characterizing groups by their prime graphs, their non-commutating graphs or their character degree graphs have been extensively discussed in the literature. The main focus in these studies is to provide an easy algorithm for determining that two finite groups are isomorphic or not. In this paper, the authors consider this problem for semigroups. For a semigroup \(S\), let \(L\) and \(R\) denote the left and the right Green relation on \(S\), respectively. Let \(S\) and \(T\) be two completely simple semigroups such that their \(H\) classes are abelian groups. As the main result in this note, using \textit{P. J. Cameron} and \textit{S. Ghosh}'s [Discrete Math. 311, No. 13, 1220--1222 (2011; Zbl 1276.05059)] theorem about power graphs of abelian groups, the authors show that \(S\) and \(T\) are isomorphic if and only if there exists a graph isomorphism from the power graph of \(S\) to the power graph of \(T\) which maps an \(R\)-class and an \(L\)-class of \(S\) to an \(R\)-class and an \(L\)-class of \(T\), respectively.