有限半群上各种图的相等性
Equality of various graphs on finite semigroups
摘要：
本文考虑有限半群$S$上的各种图，即：幂图、循环图、增强幂图和交换图。对于这四个图的任意一对，我们对有限半群进行分类，使得这对图中的图是相等的。在这方面，我们也给出了每一个图的$S$的一个充要条件，使它是完全的。本文的工作推广了群的相应结果。
英文摘要：
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the graphs in this pair are equal. In this connection, for each of the graph we also give a necessary and sufficient condition on $S$ such that it is complete. The work of this paper generalize the corresponding results obtained for groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
