2002
DOI: 10.1007/s002330010128
|View full text |Cite
|
Sign up to set email alerts
|

The zero-divisor graph of a commutative semigroup

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
112
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 193 publications
(112 citation statements)
references
References 1 publication
0
112
0
Order By: Relevance
“…But from Theorem 2.2, we have (1,4), (1,6), (1,8), (2,2), (2,4), (2,6), (2,8), (3,2), (3,4), (3,6), (3,8), (4,2), (4,4), (4,6), (4,8) 1,2), (1,4), (1,5), (1,6), (1,8), (2,2), (2,4), (2,5), (2,6), (2,8), (3,2), (3,4), (3,5), (3,6), (3,…”
Section: Theorem 22mentioning
confidence: 97%
See 2 more Smart Citations
“…But from Theorem 2.2, we have (1,4), (1,6), (1,8), (2,2), (2,4), (2,6), (2,8), (3,2), (3,4), (3,6), (3,8), (4,2), (4,4), (4,6), (4,8) 1,2), (1,4), (1,5), (1,6), (1,8), (2,2), (2,4), (2,5), (2,6), (2,8), (3,2), (3,4), (3,5), (3,6), (3,…”
Section: Theorem 22mentioning
confidence: 97%
“…In this case V = Z(R 1 )* = {(1,0), (2,0), (1,3), (1,6), (2,3), (2,6) The closed neighborhoods of the vertices are (1,3), (1,6), (2,3), (2,6) …”
Section: Properties Of Adjacency Matrix Mmentioning
confidence: 99%
See 1 more Smart Citation
“…For a given ideal I of a commutative ring R, he defined an undirected graph Γ I (R) with vertices {x ∈ R\I : xy ∈ I f or some y ∈ R\I}, where distinct vertices x and y are adjacent if and only if xy ∈ I. The zero-divisor graph of various algebraic structures has been studied by several authors [ [4], [5], [7] and [11]]. …”
Section: Introductionmentioning
confidence: 99%
“…In 2002, DeMeyer, Mckenzie and Schneider began the study of zero-divisor graph of a commutative semigroup with 0 in [6]. Since then, much work has been done and this becomes a lively branch in semigroup theory and graph theory, see e.g.…”
Section: Introductionmentioning
confidence: 99%