2011
DOI: 10.1080/00927872.2010.488675
|View full text |Cite
|
Sign up to set email alerts
|

A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors

Abstract: Abstract. We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify associated primes from the graph.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
55
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 82 publications
(55 citation statements)
references
References 10 publications
0
55
0
Order By: Relevance
“…Zero divisor graph is very useful to find the algebraic structures and properties of rings. Recently, the graph of equivalence classes of zero divisors of a commutative Noetherian ring was studied by Spiroff and Wickham in [14]. Note that if R is a unit-duo ring, then for all x, y ∈ R, [xy] = [x][y], i.e., multiplication is well defined on {[x] | x ∈ R}.…”
Section: R[x]mentioning
confidence: 99%
“…Zero divisor graph is very useful to find the algebraic structures and properties of rings. Recently, the graph of equivalence classes of zero divisors of a commutative Noetherian ring was studied by Spiroff and Wickham in [14]. Note that if R is a unit-duo ring, then for all x, y ∈ R, [xy] = [x][y], i.e., multiplication is well defined on {[x] | x ∈ R}.…”
Section: R[x]mentioning
confidence: 99%
“…In [13] the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring was introduced as follows.…”
Section: Between ( ) and The Zero Divisorsmentioning
confidence: 99%
“…In [12], Redmond introduced the zero-divisor graph with respect to a proper ideal. Since then, there has been a lot of interest in this subject and various papers were published establishing different properties of these graphs as well as relations between graphs of various extensions (see [2], [11], [12] and [13]). Recently, such graphs are used to study semirings [5], [6] and [9].…”
Section: Introductionmentioning
confidence: 99%