2007
DOI: 10.1155/2007/50875
|View full text |Cite
|
Sign up to set email alerts
|

Thek-Zero-Divisor Hypergraph of a Commutative Ring

Abstract: The concept of the zero-divisor graph of a commutative ring has been studied by many authors, and the k-zero-divisor hypergraph of a commutative ring is a nice abstraction of this concept. Though some of the proofs in this paper are long and detailed, any reader familiar with zero-divisors will be able to read through the exposition and find many of the results quite interesting. Let R be a commutative ring and k an integer strictly larger than 2. A k-uniform hypergraph H k (R) with the vertex set Z(R,k), the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…By extending the idea of Theorem 2.5 of [13], we obtain the following theorem. For the definition of a clique, we refer to [7].…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…By extending the idea of Theorem 2.5 of [13], we obtain the following theorem. For the definition of a clique, we refer to [7].…”
Section: Discussionmentioning
confidence: 99%
“…In [7], R is a commutative ring with nonzero identity. A nonzero and nonunit element z 1 of R is called a k-zero-divisor of R if k − 1 distinct nonunit elements z 2 , z 3 , z 4 , .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the literature, there are many papers assigning graphs to ideals of rings, see [10][11][12][13][14]. In [15], Eslahchi and Rahimi have introduced and investigated a graph called the k-zero-divisor hypergraph of a commutative ring. In this view, we define k-annihilating ideal of a commutative ring.…”
Section: Introductionmentioning
confidence: 99%
“…Later in [2], Anderson and Livingston modified this idea when studied the zero divisor graph that have vertices and for , edges if and only if . Many authors studied this notion see for examples [3], [4], [5] and [6] Recently, there are other concepts of zero divisor graph, see for examples [7], [8], [9] and In graph theory " denotes by the eccentricity of a vertex v of a connected graph G which is the number . That means is the distance between v and a vertex furthest from v. The radius of G ,which is denoted by is , while the diameter of G is the maximum eccentricity and it is denoted by .…”
mentioning
confidence: 99%