Inclusion graph of annihilators in a commutative ring
Abstract
Let R be a commutative ring with identity, and let Z(R) be the set of zero-divisors of R. The inclusion graph of annihilators in R, denoted by Γ(R), is a graph with the vertex set Z(R)*=Z(R)\0\ and two distinct vertices x and y are adjacent if and only if annR(x)⊂eq annR(y) or annR(y)⊂eq annR(x). It is proved that Γ(R) is not connected if and only if R is reduced with |Min(R)|=2. Also, we show that if Γ(R) is a connected graph, then the diameter of Γ(R) is at most 4 and the girth of Γ(R) is at most 6, if it contains a cycle. Moreover, we study the affinity between inclusion graph of annihilators and complement of the annihilator graph (a well-known graph with the same vertices and two distinct vertices x and y are adjacent if and only if annR(xy)≠ annR(x) annR(y)) associated with a commutative ring. Finally, we characterize all rings whose inclusion graphs of annihilators are complete.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.