Abstract
Let be a commutative ring with nonzero identity and be a fixed integer. The k-zero-divisor hypergraph of consists of the vertex set , the set of all k-zero-divisors of , and the hyperedges of the form , where are k distinct elements in , which means (i) and (ii) the products of all elements of any () subsets of are nonzero. This paper provides two commutative rings so that one of them induces a family of complete k-zero-divisor hypergraphs, while another induces a family of k-partite -zero-divisor hypergraphs, which illustrates unbalanced or asymmetric structure. Moreover, the diameter and the minimum length of all cycles or girth of the family of k-partite -zero-divisor hypergraphs are determined. In addition to a k-zero-divisor hypergraph, we provide the definition of an ideal-based k-zero-divisor hypergraph and some basic results on these hypergraphs concerning a complete k-partite k-uniform hypergraph, a complete k-uniform hypergraph, and a clique.
Keywords:
k-zero-divisor; k-zero-divisor hypergraph; ideal-based k-zero-divisor; ideal-based k-zero-divisor hypergraph; complete k-uniform hypergraph; k-partite k-uniform hypergraph; k-partite σ-uniform hypergraph; clique MSC:
05C65; 13A99; 13A15
1. Introduction
Graph structures and algebraic structures are closely related. For example, if is a commutative ring and is the finite set of all zero-divisors of , then can be regarded as a set of vertices of a graph G, and two elements in can have an edge connecting between them whenever their product is zero. This graph G is called a zero-divisor graph of commutative ring , denoted by , which was first introduced by Beck [1]. Beck studied the coloring and clique of a zero-divisor graph.
Afterward, the definition of a zero-divisor graph was slightly changed by Anderson and Livingston [2]. The vertex set consists of all nonzero zero-divisors of commutative rings. They investigated the completeness and automorphisms, denoted by Aut, of a zero-divisor graph.
Several algebraic structures have been considered, for instance, the zero-divisor graph of non-commutative rings [3,4] and the zero-divisor graph of semigroups [5,6].
Later, the graph was generalized into a hypergraph and the zero-divisor was generalized into a k-zero-divisor. Eslahchi and Rahimi [7] were the first who introduced k-zero-divisor and its k-zero-divisor hypergraph.
In [7], is a commutative ring with nonzero identity. A nonzero and nonunit element of is called a k-zero-divisor of if distinct nonunit elements differ from and satisfy the following statements:
- (i)
- ;
- (ii)
- the products of all elements of any subsets of are nonzero.
We use to denote the set of all k-zero-divisors of . Note that the elements above must be nonzero elements. Thus, if is finite, then it is natural to define the k-zero-divisor hypergraph [7] as follows:
Let be a fixed positive integer. A k-zero-divisor hypergraph of a commutative ring with nonzero identity, denoted by , is defined as a k-uniform hypergraph whose vertex set is , and the set is a hyperedge if it satisfies the following statements:
- (i)
- ;
- (ii)
- the products of all elements of any subsets of are nonzero.
k-zero-divisor hypergraphs have been extensively studied. Eslahchi and Rahimi [7] studied a two-colorable , the connectedness and the completeness of three-zero-divisor hypergraphs; then Chelvam et al. [8] studied the planarity of k-zero-divisor hypergraphs.
After, Siriwong et al. [9] used a k-partite k-uniform hypergraph modified from the definition of Kuhl and Schroeder [10] to construct a complete k-partite k-zero-divisor hypergraph. For ease of reference, they found that there exists a complete k-partite k-zero-divisor hypergraph whose vertex set is , where , , and D is a principal ideal domain (PID) with nonzero identity containing at least distinct k prime elements, say , , , …, and , such that is finite.
In addition to a zero-divisor graph, Redmond [11] provided the definition of an ideal-based zero-divisor graph as follows: Let I be an ideal of a commutative ring . An ideal-based zero-divisor graph of a commutative ring , denoted by , is defined as an undirected graph whose vertex set is , and distinct vertices x and y are adjacent if and only if . Several authors investigated some results of the ideal-based zero-divisor graph of a commutative ring [12,13,14].
Elele [15] generalized the idea of an ideal-based zero-divisor graph of a commutative ring to a three-zero-divisor hypergraph of a commutative ring regarding I, denoted by . A three-zero-divisor hypergraph of a commutative ring regarding I is a three-uniform hypergraph whose vertex set is .
In this paper, we let be a positive integer and be the set of all units of a ring . If D is a PID and I is its ideal, then is a commutative ring. Instead of considering the k-zero divisor hypergraph of a commutative ring, we consider the k-zero-divisor hypergraph of . The following are some useful tools equipped with a PID [16].
Let a and b be nonzero elements of D, and let d be a generator of the principal ideal containing a and b. Then,
- (A)
- gcd can be written as a D-linear combination of a and b, and d is unique up to multiplication by a unit of D.
- (B)
- If gcd, then is a unit of the quotient ring .
For other mathematical tools in abstract algebra, we refer the reader to the book by Dummit and Foote [16].
Together with a commutative ring , we are interested in two hypergraph structures:
- (i)
- For , the complete k-uniform hypergraph on n vertices is a k-uniform hypergraph, which has all k subsets of the n set of vertices as hyperedges [17].
- (ii)
- For a fixed integer , the k-partite -uniform hypergraph consists of the vertex set V partitioned into k subsets , , , …, and E is a hyperedge if. A k-partite -uniform hypergraph is said to be complete if the hyperedge set contains all hyperedges satisfying the above property (modified from [18]).
In Section 3, through combination with the idea of Siriwong et al. [9] and the idea presented in Section 2, we choose another ideal I of D that enables us to construct the k-partite -zero-divisor hypergraph of with the integer . Moreover, we determine its diameter and minimum length of all cycles or girth. For the definition of diameter and cycles in a hypergraph, we refer to [19,20], respectively.
In Section 4, by considering an appropriate ideal I of D in the previous sections, we generalize the concept of an ideal-based zero-divisor graph and a three-zero-divisor hypergraph regarding ideal to an ideal-based k-zero-divisor hypergraph and provide some results on this hypergraph.
In the last section, conclusions and some observations are provided.
2. Complete -Zero-Divisor Hypergraphs
Assume that D has a prime element, say p. Then, we can obtain the ideal l consequently, is a commutative ring with nonzero identity and we can easily see that
Next, under some conditions, we can determine , the set of all k-zero-divisors of the ring , and show the completeness of the k-zero-divisor hypergraph .
Theorem 1.
Assume that is finite and . Then, . Consequently, is a complete k-zero-divisor hypergraph.
Proof.
Let . Then, x can be written in the form of , where .We see that a is a multiples of a prime p but not of . Then, can find elements in so that their product is and any elements of them do not have product . Thus, .
Conversely, let . Then, there exist distinct nonzero nonunit elements that differ from x such that their product is and the products of all elements of any elements of such k elements are not . Since , x can be written in the form of . Since , by the property B, gcd, states .
Since is a nonzero element of , we obtain . Therefore, . Then, . By (1), . Otherwise, some products of elements of such k elements are , which is a contradiction. Thus, . Therefore, .
Hence, we can determine by .
By the above consideration, the product of any k element is , but all products of any element of such k elements are not . Therefore, we have all k subsets forming the hyperedges of . Hence, is a complete k-uniform hypergraph. □
Since , we obtain the following corollary:
Corollary 1.
can be separated into four disjoint subsets: , , , and .
Proof.
Let . Assume that . If gcd, then when or when . Otherwise, by the property B, we have that is a unit of . □
Corollary 1 has a computational consequence. In particular, if and is the Euler -function, then and . Thus, the numbers of vertices and hyperedges of are and , respectively.
Example 1.
Consider . By Corollary 1, . Furthermore, , , , , , , , , , , , , , , , , , . The cardinality of the hyperedge set, , is . These are some examples of elements of ,
3. -Partite -Zero-Divisor Hypergraphs
Assume further in this section that D has at least k nonassociative distinct prime elements, say , and let for all . Then, and its -zero-divisors are considered. Throughout this section, let and .
We see that each hyperedge of such k-partite -uniform hypergraph can have one or more elements from some partite sets, but no more than elements from such partite sets.
It is tedious to check but worth to mention the following facts:
and
Next, under some conditions, we can separate the set of all -zero-divisors of into k-partite sets.
Theorem 2.
and is mutually disjoint. Consequently, we construct a k-partite σ-zero-divisor hypergraph whose vertex set is .
Assume that is finite, and for all ,
. Then, , where
Proof.
Let . Then, x is written in the form of , where a is neither divisible by two distinct primes and where , nor multiples of . Otherwise, some elements in have product . Therefore, .
Conversely, let . Then, for some . Assume that . Thus, x is written in the form of , where . Therefore, there exist elements, consisting of elements from and elements from , where , together with x, so that their product is and the products of all elements of any subsets of the set containing x and such chosen elements are not . Otherwise, . We can prove the case using a similar idea for the case . Therefore, .
By the above consideration, we find elements whose product is , but any element of such elements such that their product is not . We see that at least one element of such elements is from one of the k-partite sets. Therefore, the subset forms a hyperedge of . Hence, is a k-partite -uniform hypergraph. □
From the structure of the k-partite -zero-divisor hypergraph obtained from Theorem 2, we can see that each hyperedge contains different numbers of vertices in each partite set. This illustrates the unbalanced or asymmetric structure of our hypergraph.
In this section, the k-partite -zero-divisor hypergraph is not complete because we have only the hyperedge of the form , , where for all and . However, we cannot find the hyperedge of the form , , , …, , , , , …, , , , , …, , …, , , , …, , where for all and from ; that is, if this hypergraph is complete, we need to construct a hyperedge by vertices from , vertices from , vertices from , …, and vertices from for all , .
Remark 1.
For computational purpose, let , , and be nonassociate distinct prime elements. Since gcd, by property A, there exist nonzero elements such that . Then, , that is, and are comaximal, see [16]. Per Chinese Remainder Theorem [16], . Then, in Theorem 2 can actually be defined by:
and
Thus, if , then Corollary 1 implies:
- 1.
- andfor;
- 2.
- and for .
Remark 2.
We know that has no 2-zero-divisor. If one component of is , we define the partite set corresponding to by
Example 2.
Considering , we have , , and . Then, , and . These are some examples of elements of ,
Now, we consider with its diameter and girth.
Corollary 2.
The diameter of is 2.
Proof.
Let x and y be distinct vertices of . If x and y are in the same partite set with , then there is no hyperedge E connecting x and y. Assume that and for some hyperedges and . We see that there exists a vertex v in the other partite sets such that . Then, we obtain a path of length 2. Otherwise, we obtain that the distance between x and y is 1. □
To consider the girth, we need to split into two cases of , that is, and , which can be separated into two subcases with cases of k.
Since has only one hyperedge, this hypergraph has no cycle. If a hypergraph contains no cycle, its girth is defined as ∞. We obtain the following corollary:
Corollary 3.
The girth of is ∞ when .
Next, we consider the case . By applying Theorem 2, we obtain the girth of in the other cases as follows.
Corollary 4.
The girth of is 2 when and .
Proof.
Assume that and . Since , there exist two distinct subsets, which form two distinct hyperedges and having one common element, say . Then, we have a cycle of length 2 for some vertex , which is a possible smallest cycle. Thus, the girth is 2. □
Corollary 5.
Assume that and . The girth is
Proof.
By the condition of and , has no cycle. Therefore, the girth is ∞ in the first case.
In cases 2 and 3, we see that implies that two distinct subsets form two distinct hyperedges and having one common element, say . Then, we have a cycle of length 2 for some vertex , which is a possible smallest cycle. Thus, the girth is 2.
Finally, we see that is a bipartite graph that has no multiple edge. Since bipartite graphs have no odd cycle [21], the girth is 4. □
4. Ideal-Based -Zero-Divisor Hypergraphs
In the previous consideration, we considered a commutative ring , where D is a PID and I is the appropriate ideal of D, which enabled us to define the relationship between an algebraic structure and a hypergraph structure related to an ideal-based zero-divisor graph.
By extending the definition of a 3-zero-divisor hypergraph of a commutative ring regarding I [15], we have the following definitions:
Definition 1.
Let be a commutative ring with nonzero identity and I be a nonzero proper ideal of . An element of is called an ideal-based k-zero-divisor if there exist distinct elements differing from and satisfying the following statements:
- (i)
- ;
- (ii)
- the products of all elements of any subsets of are not in I.
Let denote the set of all ideal-based k-zero-divisors of . Note that the elements above are also not in I. Let us define the ideal-based k-zero-divisor hypergraph as follows:
Definition 2.
Let be a commutative ring with nonzero identity and be a fixed positive integer. An ideal-based k-zero-divisor hypergraph of a commutative ring , denoted by , is defined as a k-uniform hypergraph whose vertex set is ; the set is a hyperedge if it satisfies the following statements:
- (i)
- ;
- (ii)
- the products of all elements of any subsets of are not in I.
Next, we provide the definition of a useful ideal to investigate some results involving an ideal-based k-zero-divisor hypergraph.
Definition 3
([22]). Let be a commutative ring with nonzero identity. A proper ideal I of is called an n-absorbing ideal if whenever for , then there are n elements of whose product is in I.
By generalizing the idea of Proposition 1 in [15], we obtain the following theorem:
Theorem 3.
Let be a commutative ring with nonzero identity and be a fixed positive integer. The following statements hold:
- 1.
- If I is a zero ideal, then .
- 2.
- Let I be a nonzero ideal of . Then, if and only if I is a -absorbing ideal of .
Proof.
- 1.
- Assume that I is a zero ideal. Then,
- (i)
- if and only if ;
- (ii)
- the products of all elements of any subsets of are not in I if and only if the products of all elements of any subset of are nonzero.
We obtain , as two hyperedge sets are also the same set. - 2.
- Let I be a nonzero ideal of . Assume that I is a -absorbing ideal of . Suppose that . Then, there exists such that and the products of all elements of any subset of are not in I. Since I is a -absorbing ideal, a product of k elements of is in I, which is a contradiction.Conversely, assume that . If and for some , then the products of some subsets of are in I. Therefore, I is a -absorbing ideal.
□
Next, we determine the relationship between a k-zero-divisor hypergraph of a commutative ring , denoted by , and an ideal-based k-zero-divisor hypergraph of a commutative ring , denoted by .
Theorem 4.
Let be a commutative ring with nonzero identity, I be a nonzero proper ideal of , and let . The following statements hold:
- 1.
- If there exists a hyperedge E containing and in , then there exists a hyperedge containing x and y in .
- 2.
- If there exists a hyperedge E containing x and y in and , then there exists a hyperedge containing and in .
- 3.
- If there exists a hyperedge E containing x and y in and , then .
Proof.
- 1.
- Assume that there exists a hyperedge E containing and in . Then, and the products of all elements of any subset of are not . Thus, and the products of all elements of any subset of are not in I. Therefore, there exists a hyperedge containing x and y in .
- 2.
- Assume that there exists a hyperedge E containing x and y in and . Then, and the products of all elements of any -subsets of are not in I. Thus, . We know that . Since , we have and then the products of all elements of any -subsets of are not . Therefore, there exists a hyperedge containing and in .
- 3.
- Assume that there exists a hyperedge E containing x and y in and . Then, and the products of all elements of any subset of are not in I. Thus, . Since , we have . Since , we have . Then, . Otherwise, , which implies , and then , which is a contradiction. Since , we have , which implies that . can be proved using the same idea.
□
Then, we study a complete k-partite k-uniform hypergraph according to the definition modified from Kuhl and Schroeder [10].
Lemma 1.
Let be a complete k-partite k-uniform hypergraph. If , then x and y must be in the same partite set.
Proof.
Let be a complete k-partite k-uniform hypergraph. Assume that . Then, for some . Without loss of generality, assume that and for each . Since , we have . Thus, is not a hyperedge.
Case 1. Suppose that for some . It contradicts the fact that , and is a complete k-partite k-uniform hypergraph.
Case 2. Suppose that . It contradicts the fact that is not a hyperedge.
Hence, x and y must be in the same partite set. □
By manipulating Theorem 2 of [15], we have Theorem 5.
Theorem 5.
Let be a commutative ring with nonzero identity and I be a nonzero proper ideal of . The following statements hold:
- 1.
- If are distinct k prime ideals of and , then is a complete k-partite k-uniform hypergraph.
- 2.
- Let for every ideal-based k-zero-divisor . If is a complete k-partite k-uniform hypergraph, then there exist k prime ideals and such that .
Proof.
- 1.
- Let such that and the products of all elements of any subset of are not in I. Then, and . Since for each , is a prime ideal, we have or or or … or .
Since the products of all elements of any subset of are not in . Then, the product of subsets of is not in for some . Without loss of generality, assume that the product of all elements of is not in for each . Since is a prime ideal, we see that . Then, , which is a partite set. Hence, is a complete k-partite k-uniform hypergraph.
- 2.
- Let for every ideal-based k-zero-divisor . Assume that is a complete k-partite k-uniform hypergraph with k partite sets and .
Let for all . Next, we show that are prime ideals.
It suffices to show that is a prime ideal. For . where , it can be proved using the same idea. First, we claim that is an ideal. Let .
Case 1. . Then, , which implies that .
Case 2. . Then, there exist such that and the products of all elements of any subset of are not in I, , and the products of all elements of any subset of are not in I. Therefore, .
Assume that is not a hyperedge. Otherwise, , which implies that .
Case 2.1. The products of all elements of any subset of are in I. Since is a complete k-partite k-uniform hypergraph, we have that the products of all elements of any s subset of are not in I for all . Then, there exist two elements and such that and , where . By Lemma 1, , which is a contradiction.
Case 2.2. There are some products of any element of in I. Then, there exists one element such that its product with in I, say ; that is, . By Lemma 1, . Thus, , which implies that . Since is not a hyperedge, we have . Since and , . It contradicts the fact that is a hyperedge.
Case 3. Without loss of generality, let and . Then, there exist such that and . Thus, . Since and for all , forms a hyperedge. Then, the products of all elements of any subset of are not in I.
Suppose that . Since , we have , which is a contradiction. For the other products of any element of , they can all be proved using the same idea as above. Thus, forms a hyperedge. Therefore, , which implies that .
Now, we obtain that . It remains to show that for all and . Let and .
Case 1. . Then, , which implies that .
Case 2. and . Then, there exist such that and the products of all elements of any -subsets of are not in I. Thus, .
Suppose that is not a hyperedge. Otherwise, , which implies that .
Case 2.1. The products of all elements of any subset of are in I. Since is a complete k-partite k-uniform hypergraph, the products of all elements of any s subset of are not in I for all . Then, there exist two elements and such that and , where . By Lemma 1, , which is a contradiction.
Case 2.2. There are some products of any element of in I. Then, there exists one element such that its product with in I, say ; that is, . Thus, . Since , by Lemma 1, . Then, and are hyperedges. Since , we have . It contradicts the fact that is a hyperedge.
Next, we show that is a prime ideal. Let such that .
Suppose that .
Case 1. and . It contradicts the fact that is a complete k-partite k-uniform hypergraph.
Case 2. and . We see that . Otherwise, , which implies , which is a contradiction. Then, there exists such that . Without loss of generality, assume that . Thus, there exist such that is a hyperedge. Since , we have , which is a contradiction.
Case 3. and . By Lemma 1, x and y are in the same partite set. We see that . Otherwise, , which implies , which is a contradiction. Without loss of generality, assume that . Then, there exist such that , and the products of all elements of any subset of are not in I, , and the products of all elements of any subset of are not in I. By Lemma 1, and . Since is a complete k-partite k-uniform hypergraph, is a hyperedge. Since , we have , which is a contradiction. □
From Theorem 5, we can also conclude that
Theorem 6.
If for every ideal-based k-zero-divisor , then is a complete k-partite k-uniform hypergraph if and only if , where are distinct k prime ideals of .
Example 3.
For and , we can separate into 3 partite sets
,
and . We see that is a complete 3-partite 3-uniform hypergraph, but I cannot be written as the intersection of three prime ideals.
In addition to a complete k-partite k-uniform hypergraph, we investigate the completeness of .
Theorem 7.
Let be a commutative ring with nonzero identity and I be a nonzero proper ideal of . The following statements hold:
- 1.
- Assume that for any k elements in , their product is in I. If I is not a -absorbing ideal, then is a complete k-uniform hypergraph.
- 2.
- If is a complete k-uniform hypergraph, then I is not a -absorbing ideal.
Proof.
- 1.
- Assume that for any k elements in , their product is in I and I is not a -absorbing ideal. Since I is not a -absorbing ideal, all products of any element in are not in I. Therefore, these k elements form a hyperedge of . Therefore, is a complete k-uniform hypergraph.
- 2.
- Assume that is a complete k-uniform hypergraph. Then, every k element in forms a hyperedge; that is, and the products of all elements of any subset of are not in I, for all .
Suppose that I is a -absorbing ideal. Since , there exists a product of some elements of is in I, which is a contradiction. □
From Theorem 7, we can also conclude that:
Theorem 8.
If for any k element in , its product is in I, then is a complete k-uniform hypergraph if and only if I is not a -absorbing ideal.
Example 4.
For and , we have
. We see that is a complete 3-uniform hypergraph and I is not a 2-absorbing ideal.
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].
Let be a k-uniform hypergraph. A subset K of the vertex set is called a clique if every k subset of K is a hyperedge of .
Theorem 9.
Let be a commutative ring and I be a nonzero proper ideal of , and let K be a clique in such that for all . If I is not a -absorbing ideal, then is an ideal of .
Proof.
Assume that I is not a -absorbing ideal. First, we claim that for all . Let .
Case 1. . Then, , which implies that .
Case 2. with . Then, there exist such that and the products of all elements of any subset of
are not in I, , and the products of all elements of any subset of are not in I. Thus, . Since I is not a -absorbing ideal, the products of all elements of any subset of are not in I. Since K is a clique, .
Case 3. Without loss of generality, and . Then, there exist
such that and the products of all elements of any subset of are not in I. Since , we have . Thus, and the products of all elements of any subset of are not in I. Since K is a clique, .
Next, we show that for all and . Let and .
Case 1. . Then, , which implies that .
Case 2. and . Then, there exist such that , and the products of all elements of any subset of are not in I. Thus, . Since I is not a -absorbing ideal, the products of all elements of any subset of are not in I. Since K is a clique, . □
Example 5.
For and , we have . We see that is a clique in , and I is not a 2-absorbing ideal, but is not an ideal.
5. Discussion and Conclusions
In the study of a k-zero-divisor hypergraph, we considered a commutative ring , where D is a PID and I is the appropriate ideal of D instead of considering directly a commutative ring .
The existence of a prime element p of D and the finiteness of together with enabled us to construct a complete hypergraph .
Next, by assuming the existence of nonassociative distinct prime elements of D, the finiteness of , where and for all , together with for all , the vertex set , where , can be partitioned into k partite sets. This enabled us to construct a k-partite -zero-divisor hypergraph of . However, our constructed k-partite -zero-divisor hypergraph is not complete.
Furthermore, the diameter of is two and the girth of
can be either four, two or infinity depending on , the cardinality of , and the cardinality of each partition set. We notice here again that two can not be the girth of a k-partite graph.
According to an ideal-based k-zero-divisor hypergraph, we obtained the relationship between and . Under some conditions of an ideal I, we provided characterizations of a complete k-partite k-uniform hypergraph and a complete k-uniform hypergraph. We provided a result regarding a clique in .
As for future research, we suggest investigating how to construct k-partite -zero-divisor hypergraphs to be a complete k-partite -uniform hypergraph according to the definition modified from Jirimutu and Wang [18]. There are also some open questions on the ideal-based k-zero-divisor hypergraph such as:
- Is it true that is connected and diam when is a commutative ring with nonzero identity and I is a nonzero proper ideal of ?
- Which conditions of an ideal I are required to construct a k-partite -uniform hypergraph according to the definition modified from Jirimutu and Wang [18]?
Author Contributions
Conceptualization, P.S. and R.B.; methodology, P.S. and R.B.; validation, P.S. and R.B.; formal analysis, P.S. and R.B.; investigation, P.S. and R.B.; writing—original draft preparation, P.S.; writing—review and editing, R.B.; supervision, R.B.; project administration, R.B. All authors have read and agreed to the published version of the manuscript.
Funding
The first author of this research was funded by a grant from the Science Achievement Scholarship of Thailand.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| PID | Principal Ideal Domain |
References
- Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
- Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
- Akbari, S.; Mohammadian, A. Zero-divisor graphs of non-commutative rings. J. Algebra 2006, 296, 462–479. [Google Scholar] [CrossRef][Green Version]
- Redmond, S.P. The Zero-Divisor Graph of a Non-Commutative Ring. Int. J. Commut. Rings 2002, 1, 203–211. [Google Scholar]
- DeMeyer, F.; DeMeyer, L. Zero-divisor graphs of semigroups. J. Algebra 2005, 283, 190–198. [Google Scholar] [CrossRef]
- DeMeyer, F.R.; McKenzie, T.; Schneider, K. The Zero-divisor Graph of a Commutative Semigroup. Semigroup Forum 2002, 65, 206–214. [Google Scholar] [CrossRef]
- Eslahchi, C.; Rahimi, A.M. The k-zero-divisor hypergraph of a commutative ring. Int. J. Math. Math. Sci. 2007, 2007, 15. [Google Scholar] [CrossRef]
- Chelvam, T.T.; Selvakumar, K.; Ramanathan, V. On the planarity of the k-zero-divisor hypergraphs. AKCE Int. J. Graphs Comb. 2015, 12, 169–176. [Google Scholar] [CrossRef]
- Siriwong, P.; Boonklurb, R.; Pianskool, S. k-zero-divisor hypergraphs of finite commutative rings. In Proceedings of the 21st Annual Meeting in Mathematics and Annual Pure and Applied Mathematics Conference, Bangkok, Thailand, 23–25 May 2016; pp. 9–16. [Google Scholar]
- Kuhl, J.; Schroeder, M.W. Hamilton cycle decompositions of k-uniform k-partite hypergraphs. Australas. J. Combin. 2013, 56, 23–37. [Google Scholar]
- Redmond, S.P. An Ideal-Based Zero-Divisor Graph of a Commutative Ring. Commun. Algebra 2003, 31, 4425–4443. [Google Scholar] [CrossRef]
- Anderson, D.F.; Shirinkam, S. Some Remarks on the Graph ΓI(R). Commun. Algebra 2014, 42, 545–562. [Google Scholar] [CrossRef]
- Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Zero-Divisor Graph with Respect to an Ideal. Commun. Algebra 2006, 34, 923–929. [Google Scholar] [CrossRef]
- Mojdeh, D.A.; Rahimi, A.M. Dominating Sets of Some Graphs Associated to Commutative Rings. Commun. Algebra 2012, 40, 3389–3396. [Google Scholar] [CrossRef]
- Elele, A.B.; Ulucak, G. 3-Zero-Divisor Hypergraph Regarding an Ideal. In Proceedings of the 7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO), Sharjah, United Arab Emirates, 4–6 April 2017; pp. 1–4. [Google Scholar]
- Dummit, D.S.; Foote, R.M. Abstract Algebra, 3rd ed.; John Wiley and Sons Inc.: New York, NY, USA, 2004. [Google Scholar]
- Verrall, H. Hamilton Decompositions of Complete 3-Uniform Hypergraphs. Discret. Math. 1994, 132, 333–348. [Google Scholar] [CrossRef][Green Version]
- Verrall; Wang, J. Hamilton Decomposition of Complete Bipartite 3-Uniform Hypergraphs. J. Mar. Sci. Technol. 2010, 18, 757–758. [Google Scholar]
- Gyárfása, A.; Jacobsonb, M.S.; Kézdyc, A.E.; Leheld, J. Odd Cycles and θ-Cycles in Hypergraphs. Discret. Math. 2006, 306, 2481–2491. [Google Scholar] [CrossRef]
- Ye, M. Size of k-Uniform Hypergraph with Diameter d. Discret. Math. 2003, 260, 285–293. [Google Scholar] [CrossRef][Green Version]
- West, D.B. Introduction to Graph Theory, 2nd ed.; Pearson Education: Hoboken, NJ, USA, 2000. [Google Scholar]
- Anderson, D.F.; Bandawi, A. On n-Absorbing Ideals of Commutative Rings. Commun. Algebra 2011, 39, 1646–1672. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).