World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

THE ANNIHILATING-IDEAL GRAPH OF COMMUTATIVE RINGS I

    https://doi.org/10.1142/S0219498811004896Cited by:109 (Source: Crossref)

    Let R be a commutative ring, with 𝔸(R) its set of ideals with nonzero annihilator. In this paper and its sequel, we introduce and investigate the annihilating-ideal graph of R, denoted by 𝔸𝔾(R). It is the (undirected) graph with vertices 𝔸(R)* ≔ 𝔸(R)\{(0)}, and two distinct vertices I and J are adjacent if and only if IJ = (0). First, we study some finiteness conditions of 𝔸𝔾(R). For instance, it is shown that if R is not a domain, then 𝔸𝔾(R) has ascending chain condition (respectively, descending chain condition) on vertices if and only if R is Noetherian (respectively, Artinian). Moreover, the set of vertices of 𝔸𝔾(R) and the set of nonzero proper ideals of R have the same cardinality when R is either an Artinian or a decomposable ring. This yields for a ring R, 𝔸𝔾(R) has n vertices (n ≥ 1) if and only if R has only n nonzero proper ideals. Next, we study the connectivity of 𝔸𝔾(R). It is shown that 𝔸𝔾(R) is a connected graph and diam(𝔸𝔾)(R) ≤ 3 and if 𝔸𝔾(R) contains a cycle, then gr(𝔸𝔾(R)) ≤ 4. Also, rings R for which the graph 𝔸𝔾(R) is complete or star, are characterized, as well as rings R for which every vertex of 𝔸𝔾(R) is a prime (or maximal) ideal. In Part II we shall study the diameter and coloring of annihilating-ideal graphs.

    AMSC: 13A15, 05C75