The annihilating-ideal graph of commutative semigroups
详细信息    查看全文
文摘
In this paper, we associate an undirected graph c43b1046432c9d9a017c5f23e503b" title="Click to view the MathML source">AG(S), the annihilating-ideal graph, to a commutative semigroup S  . This graph has vertex set A(S)=A(S)∖{(0)}, where A(S) is the set of proper ideals of S   with nonzero annihilator. Two distinct vertices I,J∈A(S) are defined to be adjacent in c43b1046432c9d9a017c5f23e503b" title="Click to view the MathML source">AG(S) if and only if IJ=(0), the zero ideal. Conditions are given to ensure a finite graph. Semigroups for which each nonzero, proper ideal of S   is an element of A(S) are characterized. Connections are drawn between c43b1046432c9d9a017c5f23e503b" title="Click to view the MathML source">AG(S) and Γ(S), the well-known zero-divisor graph, and the connectivity, diameter, and girth of c43b1046432c9d9a017c5f23e503b" title="Click to view the MathML source">AG(S) are described. Semigroups S   for which c43b1046432c9d9a017c5f23e503b" title="Click to view the MathML source">AG(S) is a complete or star graph are characterized. Finally, it is proven that the chromatic number is equal to the clique number of the annihilating ideal graph for each reduced semigroup and null semigroup. Upper and lower bounds for χ(AG(S)) are given for a general commutative semigroup.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.