Simple Graphs and Commutative Zero-Divisor Semigroups
Simple Graphs and Commutative Zero-Divisor Semigroups
复制标题
DOI：
--
复制
发表时间：
2005-12
期刊：
影响因子：
--
通讯作者：
Tongsuo Wu;Li Chen
中科院分区：
文献类型：
--
作者：
Tongsuo Wu;Li Chen
本文研究由图决定的交换零因子半群。证明了一类图的唯一性定理。我们证明了两类没有相应半群的图。特别地，任何具有三个以上端点的完全图和任何具有一个以上端点的完全二部图都没有相应的半群。我们还确定了所有可能的零因子图是有两个端点的完全图K_3的零因子半群。
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph $K_n$ together with more than three end vertices and any complete bipartite graph together with more than one end vertices have no corresponding semigroups. We also determine all possible zero-divisor semigroups whose zero-divisor graph is the com- plete graph $K_3$ together with two end vertices.