2012
DOI: 10.1016/j.jpaa.2011.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Commutative Boolean monoids, reduced rings, and the compressed zero-divisor graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
32
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 53 publications
(33 citation statements)
references
References 15 publications
1
32
0
Order By: Relevance
“…The compressed zero-divisor graph Γ E (R) is the (undirected) graph whose vertices are the equivalence classes induced by ∼ other than [0] and [1], such that distinct vertices [s] and [t] are adjacent in Γ E (R) if and only if st = 0. This graph was later studied more extensively in [3,8,17]. Now, we extend this definition to noncommutative rings.…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…The compressed zero-divisor graph Γ E (R) is the (undirected) graph whose vertices are the equivalence classes induced by ∼ other than [0] and [1], such that distinct vertices [s] and [t] are adjacent in Γ E (R) if and only if st = 0. This graph was later studied more extensively in [3,8,17]. Now, we extend this definition to noncommutative rings.…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…The following theorem reduces chordality of Γ(R) to chordality of Γ E (R) , the compressed zero-divisor graph of R defined in [17] and further studied in [3].…”
Section: Lemma 310mentioning
confidence: 99%
“…The zero-divisor graph of R, denoted by Γ(R), is a graph with vertices Z(R) * = Z(R) \ {0} and two distinct vertices a and b are adjacent if and only if ab = 0, see [4,6]. The compressed zero-divisor graph of R, Γ E (R), that is constructed from equivalence classes of zero-divisors, rather than individual zero-divisors themselves was introduced in [11] and studied in some literatures, for examples [3,8,13]. This graph 578 S.B.…”
Section: Introductionmentioning
confidence: 99%