Modules with annihilation property

Author(s):  
Rasul Mohammadi ◽  
Ahmad Moussavi ◽  
Masoome Zahiri

Let [Formula: see text] be an associative ring with identity. A right [Formula: see text]-module [Formula: see text] is said to have Property ([Formula: see text]), if each finitely generated ideal [Formula: see text] has a nonzero annihilator in [Formula: see text]. Evans [Zero divisors in Noetherian-like rings, Trans. Amer. Math. Soc. 155(2) (1971) 505–512.] proved that, over a commutative ring, zero-divisor modules have Property ([Formula: see text]). We study and construct various classes of modules with Property ([Formula: see text]). Following Anderson and Chun [McCoy modules and related modules over commutative rings, Comm. Algebra 45(6) (2017) 2593–2601.], we introduce [Formula: see text]-dual McCoy modules and show that, for every strictly totally ordered monoid [Formula: see text], faithful symmetric modules are [Formula: see text]-dual McCoy. We then use this notion to give a characterization for modules with Property ([Formula: see text]). For a faithful symmetric right [Formula: see text]-module [Formula: see text] and a strictly totally ordered monoid [Formula: see text], it is proved that the right [Formula: see text]-module [Formula: see text] is primal if and only if [Formula: see text] is primal with Property ([Formula: see text]).

2012 ◽  
Vol 55 (1) ◽  
pp. 127-137 ◽  
Author(s):  
John D. LaGrange

AbstractThe zero-divisor graph Γ(R) of a commutative ring R is the graph whose vertices consist of the nonzero zero-divisors of R such that distinct vertices x and y are adjacent if and only if xy = 0. In this paper, a characterization is provided for zero-divisor graphs of Boolean rings. Also, commutative rings R such that Γ(R) is isomorphic to the zero-divisor graph of a direct product of integral domains are classified, as well as those whose zero-divisor graphs are central vertex complete.


2020 ◽  
Vol 12 (1) ◽  
pp. 84-101 ◽  
Author(s):  
S. Pirzada ◽  
M. Aijaz

AbstractLet R be a commutative ring with Z*(R) as the set of non-zero zero divisors. The zero divisor graph of R, denoted by Γ(R), is the graph whose vertex set is Z*(R), where two distinct vertices x and y are adjacent if and only if xy = 0. In this paper, we investigate the metric dimension dim(Γ(R)) and upper dimension dim+(Γ(R)) of zero divisor graphs of commutative rings. For zero divisor graphs Γ(R) associated to finite commutative rings R with unity 1 ≠ 0, we conjecture that dim+(Γ(R)) = dim(Γ(R)), with one exception that {\rm{R}} \cong \Pi {\rm\mathbb{Z}}_2^{\rm{n}}, n ≥ 4. We prove that this conjecture is true for several classes of rings. We also provide combinatorial formulae for computing the metric and upper dimension of zero divisor graphs of certain classes of commutative rings besides giving bounds for the upper dimension of zero divisor graphs of rings.


2015 ◽  
Vol 46 (4) ◽  
pp. 365-388
Author(s):  
Christopher Park Mooney

In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their attention to studying divisor graphs of non-zero elements in integral domains. This inspired the so called irreducible divisor graph of an integral domain studied by J. Coykendall and J. Maney. Factorization in rings with zero-divisors is considerably more complicated than integral domains and has been widely studied recently. We find that many of the same techniques can be extended to rings with zero-divisors. In this article, we construct several distinct irreducible divisor graphs of a commutative ring with zero-divisors. This allows us to use graph theoretic properties to help characterize finite factorization properties of commutative rings, and conversely.


2021 ◽  
Vol 28 (04) ◽  
pp. 655-672
Author(s):  
K. Selvakumar ◽  
M. Subajini

Let [Formula: see text] be a commutative ring, [Formula: see text] an ideal of [Formula: see text] and [Formula: see text] a fixed integer. The ideal-based [Formula: see text]-zero-divisor hypergraph [Formula: see text] of [Formula: see text] has vertex set [Formula: see text], the set of all ideal-based [Formula: see text]-zero-divisors of [Formula: see text], and for distinct elements [Formula: see text] in [Formula: see text], the set [Formula: see text] is an edge in [Formula: see text] if and only if [Formula: see text] and the product of the elements of any [Formula: see text]-subset of [Formula: see text] is not in [Formula: see text]. In this paper, we show that [Formula: see text] is connected with diameter at most 4 provided that [Formula: see text] for all ideal-based 3-zero-divisor hypergraphs. Moreover, we find the chromatic number of [Formula: see text] when [Formula: see text] is a product of finite fields. Finally, we find some necessary conditions for a finite ring [Formula: see text] and a nonzero ideal [Formula: see text] of [Formula: see text] to have [Formula: see text] planar.


2016 ◽  
Vol 16 (08) ◽  
pp. 1750143 ◽  
Author(s):  
D. D. Anderson ◽  
Sangmin Chun

Let [Formula: see text] be a commutative ring and [Formula: see text] an [Formula: see text]-module. Let [Formula: see text] and [Formula: see text]. [Formula: see text] satisfies Property [Formula: see text] (respectively, Property [Formula: see text]) if for each finitely generated ideal [Formula: see text] (respectively, finitely generated submodule [Formula: see text]) ann[Formula: see text] (respectively, ann[Formula: see text]). The ring [Formula: see text] satisfies Property [Formula: see text] if [Formula: see text] does. We study rings and modules satisfying Property [Formula: see text] or Property [Formula: see text]. A number of examples are given, many using the method of idealization.


2019 ◽  
Vol 26 (04) ◽  
pp. 665-676
Author(s):  
Ebrahim Hashemi ◽  
Abdollah Alhevaz

Let R be an associative ring with identity and Z*(R) be its set of non-zero zero-divisors. The undirected zero-divisor graph of R, denoted by Γ(R), is the graph whose vertices are the non-zero zero-divisors of R, and where two distinct vertices r and s are adjacent if and only if rs = 0 or sr = 0. The distance between vertices a and b is the length of the shortest path connecting them, and the diameter of the graph, diam(Γ(R)), is the superimum of these distances. In this paper, first we prove some results about Γ(R) of a semi-commutative ring R. Then, for a reversible ring R and a unique product monoid M, we prove 0≤ diam(Γ(R))≤ diam(Γ(R[M]))≤3. We describe all the possibilities for the pair diam(Γ(R)) and diam(Γ(R[M])), strictly in terms of the properties of a ring R, where R is a reversible ring and M is a unique product monoid. Moreover, an example showing the necessity of our assumptions is provided.


2014 ◽  
Vol 13 (07) ◽  
pp. 1450047 ◽  
Author(s):  
S. Pirzada ◽  
Rameez Raja ◽  
Shane Redmond

For a graph G(V, E) with order n ≥ 2, the locating code of a vertex v is a finite vector representing distances of v with respect to vertices of some ordered subset W of V(G). The set W is a locating set of G(V, E) if distinct vertices have distinct codes. A locating set containing a minimum number of vertices is a minimum locating set for G(V, E). The locating number denoted by loc (G) is the number of vertices in the minimum locating set. Let R be a commutative ring with identity 1 ≠ 0, the zero-divisor graph denoted by Γ(R), is the (undirected) graph whose vertices are the nonzero zero-divisors of R with two distinct vertices joined by an edge when the product of vertices is zero. We introduce and investigate locating numbers in zero-divisor graphs of a commutative ring R. We then extend our definition to study and characterize the locating numbers of an ideal based zero-divisor graph of a commutative ring R.


2011 ◽  
Vol 10 (04) ◽  
pp. 665-674
Author(s):  
LI CHEN ◽  
TONGSUO WU

Let p be a prime number. Let G = Γ(R) be a ring graph, i.e. the zero-divisor graph of a commutative ring R. For an induced subgraph H of G, let CG(H) = {z ∈ V(G) ∣N(z) = V(H)}. Assume that in the graph G there exists an induced subgraph H which is isomorphic to the complete graph Kp-1, a vertex c ∈ CG(H), and a vertex z such that d(c, z) = 3. In this paper, we characterize the finite commutative rings R whose graphs G = Γ(R) have this property (called condition (Kp)).


2019 ◽  
Vol 19 (12) ◽  
pp. 2050226 ◽  
Author(s):  
G. Kalaimurugan ◽  
P. Vignesh ◽  
T. Tamizh Chelvam

Let [Formula: see text] be a finite commutative ring without identity. In this paper, we characterize all finite commutative rings without identity, whose zero-divisor graphs are unicyclic, claw-free and tree. Also, we obtain all finite commutative rings without identity and of cube-free order for which the corresponding zero-divisor graph is toroidal.


2019 ◽  
Vol 13 (07) ◽  
pp. 2050121
Author(s):  
M. Aijaz ◽  
S. Pirzada

Let [Formula: see text] be a commutative ring with unity [Formula: see text]. The annihilating-ideal graph of [Formula: see text], denoted by [Formula: see text], is defined to be the graph with vertex set [Formula: see text] — the set of non-zero annihilating ideals of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] adjacent if and only if [Formula: see text]. Some connections between annihilating-ideal graphs and zero divisor graphs are given. We characterize the prime ideals (or equivalently maximal ideals) of [Formula: see text] in terms of their degrees as vertices of [Formula: see text]. We also obtain the metric dimension of annihilating-ideal graphs of commutative rings.


Sign in / Sign up

Export Citation Format

Share Document