Power graphs of a class of completely 0-simple semigroups

被引:0
|
作者
Cheng, Yanliang [1 ]
Shao, Yong [1 ]
Zeng, Lingli [1 ]
机构
[1] Northwest Univ, Sch Math, Xian 710127, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Power graph; Completely 0-simple semigroup; Green's relations; Automorphisms of a semigroup; CAYLEY-GRAPHS;
D O I
10.1007/s10801-024-01306-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We first determine the structure of the power digraphs of completely 0-simple semigroups, and then some properties of their power graphs are given. As the main result in this paper, using Cameron and Ghosh's theorem about power graphs of abelian groups, we obtain a characterization that two G0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G<^>{0}$$\end{document}-normal completely 0-simple orthodox semigroups S and T with abelian group H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}$$\end{document}-classes are isomorphic based on their power graphs. We also present an algorithm to determine that S and T are isomorphic or not.
引用
收藏
页码:697 / 710
页数:14
相关论文
共 50 条