加载中…
We introduce the class of network right -abundant semigroups. These are based on networks that extend the notion of a directed graph. This class properly contains the class of graph inverse semigroups. We investigate the structure of network right -abundant semigroups. We show that two network right -abundant semigroups are isomorphic if and only if the underlying networks are isomorphic.

生成讲解博客的中文版本

生成AI智能校验的中文版本