Zero-Divisor Semigroups and Some Simple Graphs
Zero-Divisor Semigroups and Some Simple Graphs
复制标题
DOI：
10.1080/00927870600639948
复制
发表时间：
2006-08
影响因子：
0.7
通讯作者：
Tongsuo Wu;D. Lu
中科院分区：
文献类型：
--
作者：
Tongsuo Wu;D. Lu
本文研究由图决定的交换零因子半群。证明了对于所有n个≥4，完全图Kn和两个端点有唯一对应的零因子半群，而完全图Kn和三个端点没有对应的半群.我们确定了零因子图为完全图K3的所有20个零因子半群加上一个端点。
In this article, we study commutative zero-divisor semigroups determined by graphs. We prove that for all n ≥ 4, the complete graph K n together with two end vertices has a unique corresponding zero-divisor semigroup, while the complete graph K n together with three end vertices has no corresponding semigroups. We determine all the twenty zero-divisor semigroups whose zero-divisor graphs are the complete graph K 3 together with an end vertex.