Abstract.
This article focuses on the study of zero-divisor graph , annihilator graph and weakly zero-divisor graph on the ring of all real-valued functions on a topological space that are continuous outside a member of an ideal of closed subsets of . We establish that if properly contains the ring of real-valued continuous functions on , then the radius of is and it is not triangulated. Moreover, in this situation, both and are not hypertriangulated and the dominating number of is . Furthermore, fails to be a complete graph under the hypothesis . We establish a connection between the complemented-ness of and the Von-Neumann regularity of under the assumption that . We realise that any two of these three graphs coincide if and only if and in this case, the graphs are complete bipartite. We also note that the phenomena of being triangulated, hypertriangulated and complemented depend solely on the cardinality of .
keywords:
zero-divisor graph; annihilator graph; weakly zero-divisor graph; triangulated; hypertriangulated; complemented.MSC:
54C30; 54C40; 05C25.1. Introduction
Let be a Tychonoff space and denote the ring of real-valued continuous functions on . Let the collection of all real-valued functions on be denoted by and for , the set of points of discontinuities of by . As usual, the closure (interior) of a subset of is denoted by (resp. ) in . A collection of closed subsets of is said to be an ‘ideal of closed sets’ if it satisfies the following conditions:
-
(i)
is closed under taking finite union.
-
(ii)
If are closed sets in such that and , then .
The following collections form ideals of closed sets in :
-
•
the collection of all finite subsets of ,
-
•
the collection of all closed compact subsets of and
-
•
the collection of all closed nowhere dense subsets of .
The triplet is called a -space ([7]) and the collection, [7] forms a commutative ring with unity, under the operations of pointwise additions and multiplications. Note that the ring is an abstraction of various known rings of functions.
-
•
If , then .
-
•
If , then , which was introduced by Ahmadi Zand in 2010 [2].
-
•
If , then , which was introduced by Gharabaghi et. al. in 2018 [9].
-
•
The notation is used to denote in [7].
For , the ‘zero-set’, is the set . If , we write instead of . The collection is as usual denoted by and is denoted by .
On a commutative ring , Anderson and Livingston defined the zero-divisor graph, on the vertex set , consisting of all non-zero zero-divisors of the ring and two vertices and in to be adjacent in if [1]. In 2013, Badawi defined the annihilator graph on the same vertex set such that two vertices are adjacent if [5], where denotes the collection for . Another graph, called the weakly zero-divisor graph, denoted by , was defined on by Nikmehr et. al. [16]. Two distinct vertices and are adjacent in if there exist non-zero elements and such that . It follows that is a spanning subgraph of and is a spanning subgraph of . Recall that a graph is said to be the spanning subgraph of a graph if they have the same vertex set and whenever two vertices are adjacent in , they are also adjacent in .
In this article, we wish to study the above mentioned graphs defined on the collection (or simply, ) of all non-zero divisors of zero of the ring . In order to do that efficiently, we first recollect some definitions. Let be a graph defined on a vertex set . For , the distance is the length of the shortest path between and . The diameter and the girth is the length of the shortest cycle in . If has no cycles, . Furthermore, for , the associated number, of is defined as . An is said to be a center of if it has the smallest associated number. The associated number of such a center is called the radius of and is denoted by . is said to be triangulated if each vertex of is a vertex of a triangle and hypertriangulated if each edge in is an edge of a triangle. A subset of is said to be a stable set if no two vertices in the set are adjacent. is called a bipartite graph if can be decomposed into two stable sets. A bipartite graph is complete if each pair of vertices from distinct stable sets are adjacent. For two vertices , denotes the length of the shortest cycle (if any) containing and , and if there does not exist any cycle in containing and . Two distinct vertices are said to be orthogonal (denoted as ) if is adjacent to and there does not exist any which is adjacent to both and . shall be called a complemented graph if for each , there exists such that . A complemented graph is called uniquely complemented if are adjacent to the same set of vertices in , whenever and in for some . A vertex is said to be a universal vertex in if it is adjacent to all other vertices. A subset of is said to be a dominating set in if every vertex outside is adjacent to some vertex in . The dominating number, . The smallest cardinal number such that every complete subgraph of is of cardinality is said to be the clique number of , and is denoted by . For more graph theoretic terms, one can refer [6].
We observe that if has no non-zero divisors of zero, then and all the three graphs , and are then null-graphs. If is a topological space with exactly one point, then is isomorphic to , for any choice of ideal and hence all the above mentioned graphs on are null-graphs. So, to avoid this case, we shall always assume .
Throughout this article, we have made use of the space , which is generated by as a base for closed sets. First note that if , then the space is the original space . We observe that the space is a space. We also note that contains isolated points if either has isolated points or . Next we establish a relation between the Goldie dimension of the ring and the cellularity of the space . Furthermore, we describe the space of minimal prime ideals of and establish a condition under which the space is compact. We note that a few results in [3] and [11] can be established as particular cases of some theorems in this section, when we choose .
Section 3 of this article is devoted to the study of the zero-divisor graph (or simply, ) of the ring . In particular, we calculate the diameter, girth and radius of the graph. It has been noted in this section that the radius of the graph is if . Moreover, we have observed that if , then is neither triangulated nor hypertriangulated. This brings out a contrast between the zero-divisor graph of and (see Example 3.23). We note that is a complete bipartite graph if . We further observe that the clique number of and the Goldie dimension of are equal. In particular, we explicitly show that the clique number of , and are equal and equal to the cardinality of . We next establish that the compactness of the space of minimal prime ideals of is equivalent to the complemented-ness of the graph . We further recall a condition equivalent to the Von-Neumann regularity of the ring (see [7]) to establish that if , then the complemented-ness of the graph is equivalent to the Von-Neumann regularity of the ring .
Section 4 of this article deals with the annihilator graph of the ring . For simplicity, we write instead of when there is no ambiguity. We realise that coincides with if and only if and then and only then is a complete bipartite graph. Moreover, we note that the distance between any two non-adjacent vertices is and it follows that the diameter of the graph is . We further establish that is hypertriangulated if and only if and has no isolated points. However, is triangulated if and only if . We also observe a correspondence between the dominating number of and the phenomenon of being hypertriangulated.
The final section involves the weakly zero-divisor graph of the ring . We denote it by , instead of . Just as we have seen in case of and , is also a complete bipartite graph, which coincides with and if and only if . We are able to describe the distance between two vertices, diameter of and the dominating number of the graph. We further show that is a complete graph if and only if and has no isolated points. In particular, whenever properly contains , is not a complete graph. We realise that is triangulated if and only if and this is equivalent to the hypertriangulation of as well. Moreover, the above statements are equivalent to saying that is not complemented. Finally, we describe some of these results for the particular case of .
2. Prerequisites on the ring and the space
We initiate this section with the recollection that the set of all zero-sets of functions in , denoted by , forms a base for closed sets for the topology on , which is finer than the original topology on [8]. In short we denote the pair as . For a subset of , () denotes the closure (resp. interior) of in . We first observe a topological property of the space which shall be useful throughout this article.
Theorem 2.1.
is a -topological space and the collection forms a base for open sets for the space .
Proof 2.2.
Suppose is a closed set in and . Then there exists such that . Without loss of generality assume that and let . Define and . Then and are disjoint basic open sets in such that and . This ensures that is a -space.
Moreover, there exist such that and . Also since , it follows that .
The following observation helps us make certain compelling deductions regarding the rings , and .
Observation 2.3.
The assumption that the characteristic function for each (for eg.: , , , etc) ensures that , which is a base for closed sets and so is the discrete space. In this context,
Next, we note that often the existence of even a single function of the form , for some , in describes certain behaviours of graphs on the ring . Such an existence is clearly guaranteed if has an isolated point. Moreover, we have the following useful lemma.
Lemma 2.4.
contains for some if and only if either has an isolated point or there exists a non-isolated point with . Moreover, the latter holds if and only if . In particular, a point is isolated in the space if and only if either is an isolated point in or .
Proof 2.5.
If , for some , then is an isolated point in . If , then is a non-isolated point in and so . Therefore, . The converse is straightforward.
Moreover, if , where is non-isolated, then . Conversely let . Then . Let , then it follows that is a non-isolated point in and . The rest is immediate.
Recall that the cellularity of a space is defined as the smallest cardinal number such that every family of pairwise disjoint non-empty open subsets of has cardinality and a cardinal number is called the Goldie dimension, of a commutative ring if a direct sum of non-zero ideals in consists of terms where .
We now realise that the Goldie dimension, of is closely related to the cellularity of the space . This relation shall be useful in discussing the clique number of the zero-divisor graph of .
Theorem 2.6.
For a topological space , .
Proof 2.7.
Let be a direct sum of non-zero ideals in . Note that for with , as . Thus, the collection is a family of pairwise disjoint open sets in . Thus, we have and hence .
Next suppose is a family of pairwise disjoint open subsets of . Then for each , there exists such that . Set for each . We claim that the family of non-zero ideals in , constitutes an independent family. In other words, for , . Indeed, if , then , where and for . This ensures that , since for (as for ). Thus, we have a direct sum of ideals in , and so . It follows that .
Next, we wish to discuss the compactness of the space of minimal prime ideals of .
We initiate this discussion by revisiting some notations and results regarding minimal prime ideals and the space of minimal prime ideals of a commutative ring .
Lemma 2.8.
The intersection of all minimal prime ideals in is the set of all nilpotent elements in .
Lemma 2.9 ([12, Lemma 3.1]).
A prime ideal of is minimal if and only if for each , there exists such that is a nilpotent element in .
We borrow the notation, from [11] to denote the family of all minimal prime ideals of .
Notations 2.10.
-
•
For any subset of , the hull of is the collection of all minimal prime ideals of that contain the set .
-
•
For a subfamily of , the kernel is the intersection of all members of .
It is easy to verify that becomes a topological space with the understanding that a set is closed if .
The annihilator of a subset of , is defined as . A ring is said to be reduced if it does not contain any non-zero nilpotents. Clearly, any subring of is a reduced ring. A reduced ring is said to satisfy the annihilator condition, and is said to be an a.c. ring if for , there exists such that [4]. We observe that for , . Therefore, is an a.c. ring.
Theorem 2.11 ([11, Theorem 2.3]).
In a reduced ring , for , .
Theorem 2.12 ([11, Theorem 2.7]).
If is a reduced ring and , we have:
Lemma 2.13 ([11, Lemma 3.1]).
For , where is a reduced ring, if and only if .
Theorem 2.14 ([11, Theorem 3.4]).
The following conditions are equivalent for a reduced ring .
-
(1)
is compact and is an a.c. ring.
-
(2)
For , there exists such that . (Equivalently, For , there exists such that .)
We use the above results to see when is compact.
Theorem 2.15.
The space is compact if and only if for each there exists such that and .
Proof 2.16.
Let us suppose that is compact. Since is an a.c. ring, it follows from Theorem 2.14 that for , there exists such that . Let be such that . Since , and it follows that . By Theorem 2.12, and hence . Next note that implies that since otherwise there exists a minimal prime ideal of containing both and . As , . But it follows from Lemma 2.9 that there exists which is a not possible. Again, implies that . Indeed, if , then . By Lemma 2.9, there exists such that and thus, . By Theorem 2.11 we get that and so . By Theorem 2.11, where . So we have . Thus, is contained in the intersection of all minimal prime ideals of . It then follows from Lemma 2.8 and the fact that is a reduced ring that . It is then clear that which directly implies that .
Conversely let . Then there exists such that and . It is sufficient to show that and the rest will follow from Theorem 2.15. Indeed, implies that , that is and so . Next see that implies that and so . It follows that is contained in all minimal prime ideals of and hence . It is now evident from Theorem 2.11 that . Now, if , then . Indeed, if , then and so which contradicts that . Finally, it follows from Theorem 2.11 that . Thus, . This completes the proof.
The next corollary follows immediately using Observation 2.3.
Corollary 2.17.
If contains the collection , then the space is compact if and only if for each there exists such that .
3. Zero-divisor graph of
The objective of this section is to discuss the zero-divisor graph of the ring . We first characterise the zero-divisors of the ring .
Theorem 3.1.
An element is a divisor of zero in the ring if and only if .
Proof 3.2.
Suppose there exists such that . Then and so . Conversely let . Then there exists such that and so where .
The above theorem ensures that the vertex set of the three graphs which are under study in this article is given by:
We aim to shed light on the distance between two vertices in . To achieve this, we first establish a lemma.
Lemma 3.3.
For , there exists a vertex adjacent to both and if and only if .
Proof 3.4.
Let . Then there exists such that . This ensures that and is adjacent to both and . Conversely let there exist adjacent to both and . Then it follows that .
The next theorem can be proven with the help of the above lemma and by following the steps in the proof of Lemma 1.2 in [4].
Theorem 3.5.
For ,
-
(i)
if and only if ,
-
(ii)
if and only if and ,
-
(iii)
if and only if and .
In order to calculate the diameter and girth of , we need another lemma.
Lemma 3.6.
If contains (at least) three distinct elements and , then there exists such that .
Proof 3.7.
Let , and . Then , which is open in , and hence in . Thus, there exists such that . Choose . Then and . Similarly, there exist such that , and . Finally, take .
Theorem 3.8.
If is a topological space which contains at least three points, then the and .
Proof 3.9.
Let contain three distinct elements and . Then by Lemma 3.6, there exists such that . Choose such that . We then have and where and (resp. and ) are zero-sets (resp. cozero-sets) of functions in . Therefore, there exist such that and and we have and . It follows from Theorem 3.5 that and hence .
Employing the steps used in the proof of Lemma 3.6, there exists such that , and . Set and for some . Then which ensures that . Thus, are all non-zero zero-divisors in . Thus, there exists such that and so . Also see that and so . Therefore, constitutes a circle in . Thus, .
When , the graph is of a particular form.
Theorem 3.10.
The following statements are equivalent.
-
1.
.
-
2.
is a bipartite graph.
-
3.
is a complete bipartite graph.
Proof 3.11.
We note that if , then the vertex set , where and . It follows that and are stable sets and each vertex in is adjacent to each vertex in . This ensures that is a complete bipartite graph.
Moreover, if , then it follows from Theorem 3.8 that contains a triangle and thus it cannot be a bipartite graph.
The following corollary is therefore immediate.
Corollary 3.12.
If is a space with exactly two points, then and .
The associated number of each vertex is crucial data when calculating the radius of a graph. Keeping this in mind, we calculate the associated number of each vertex of .
Theorem 3.13.
For ,
Proof 3.14.
Let and . Let . If , then and hence . Again if , then . This shows that and . It follows from Theorem 3.5 that . Therefore, .
Remark 3.15.
We realise that if contains at least one such that it is zero everywhere except exactly a single point, then . Recall that if contains all singleton subsets of (e.g.: and ), then contains functions of the form . In such cases, . In particular, Moreover, recall that the ring contains functions of the form for each , even though may not contain all singleton subsets of . In conclusion, we have .
The above remark prompts us to realise that the existence of in , for even a single induces the radius of to be . The following corollary is an immediate consequence of this apprehension and can be deduced using Lemma 2.4.
Corollary 3.16.
If , then .
In the context of the zero-divisor graph being triangulated (resp. hypertriangulated), we first recall that following result established by Azarpanah and Motamedi in [4].
Theorem 3.17 ([4, Proposition 2.1]).
Suppose that .
-
(i)
is a triangulated graph if and only if has no isolated points.
-
(ii)
is a hypertriangulated graph if and only if is a connected middle -space, i.e., if every non-empty zero set of the form , where with , has a non-empty interior.
We now realise when is a vertex in a part of a triangle.
Theorem 3.18.
Let . Then is a vertex in a triangle if and only if and .
Proof 3.19.
Suppose that and and are two distinct points in . Then by Theorem 2.1, there exists such that . It is evident that and . Also, and so by Lemma 3.3, there exists a vertex such that is adjacent to both and . Therefore, , and form a triangle.
Conversely, let be a vertex of a triangle. Then it follows from Theorem 3.10 that . Now let be such that . Then . Since , and hence .
We achieve something more general and concrete when contains properly.
Theorem 3.20.
If , then is neither triangulated nor hypertriangulated.
Proof 3.21.
In this context, we must make the following remark.
Remark 3.22.
It is immediate from Theorem 3.20 that for to be triangulated and/or hypertriangulated, must be equal to . Moreover, we can make the following conclusions by implementing Theorem 3.17.
-
(i)
is triangulated if and only if and has no isolated points.
-
(ii)
is hypertriangulated if and only if and is a connected middle -space.
In particular, if is a connected middle -space with no isolated points, then note that is both triangulated and hypertriangulated but is neither triangulated nor hypertriangulated, when . We state an example to support our remark.
Example 3.23.
Let denote the set of all -valued transfinite sequences and the set of all upper elements of is denoted by . Then the Dedekind completion, of (see [10]) is a connected almost -space (and hence a middle -space) (see [13]). Thus, is both triangulated and hypertriangulated; and if , then is neither triangulated nor hypertriangulated.
In particular, (See [14]) (resp. and ) is neither triangulated nor hypertriangulated.
Next we discuss the length of a cycle in containing two specific vertices , which can be proved by following closely the proof of Proposition 2.2 in [4].
Theorem 3.24.
For a topological space and , the following assertions are true.
-
(i)
if and only if and .
-
(ii)
if and only if and or and .
-
(iii)
if and only if and .
At this point we recall Observation 2.3 to obtain the following remark.
Remark 3.25.
If and , we have
-
(i)
if and only if and .
-
(ii)
if and only if either and or and . In particular, if , then .
-
(iii)
if and only if or .
We now realise that clique number of coincides with the cellularity of , and hence also with .
Theorem 3.26.
For a -space , .
Proof 3.27.
Suppose is a complete subgraph of . Then for , and so . Hence the family, is a collection of pairwise disjoint open sets in . It follows that and since is an arbitrary complete subgraph of ,
Conversely let be a collection of pairwise disjoint non-empty open subsets of . For and , there exists such that . Fix . Then and . Let . Then each member of is a non-zero zero-divisor in and for each , as . Therefore, is a complete subgraph of . Thus, we have and as is an arbitrary collection of pairwise disjoint non-empty open subsets of , . The last equality follows directly from Theorem 2.6.
The following remark is obvious from Observation 2.3.
Remark 3.28.
If contains the collection , then is nothing but the cardinality of .
In particular, and .
We now proceed to discuss when is a complemented graph. Recall that two vertices are orthogonal if and only if they are adjacent and there is no vertex which is adjacent to both and . It follows now from Lemma 3.3 and Theorem 3.5(i) that are orthogonal if and only if and . The following theorem is now immediate.
Theorem 3.29.
is a complemented graph if and only if for each , there exists such that and .
The following corollary is now immediate with the assistance of Theorem 2.15.
Corollary 3.30.
The zero-divisor graph of the ring is a complemented graph if and only if the space of minimal prime ideals , of is compact.
An interesting characterisation of as a Von-Neumann regular ring can be achieved using the above theories, provided contains the collection . A ring is said to be Von-Neumann regular if for each , there exists such that . We first recall the following result.
Theorem 3.31 ([7, Theorem 5.7]).
A -space, is a -space (i.e., is a Von-Neumann regular ring) if and only if for , there exists with .
The next observation follows directly by using the above discussions and Observation 2.3.
Theorem 3.32.
Consider a -space such that . Then the following statements are equivalent.
-
(1)
The zero-divisor graph of is a complemented graph.
-
(2)
The space of minimal prime ideals of is compact.
-
(3)
is a Von-Neumann regular ring.
Remark 3.33.
Since the rings [9], [7] and [2] all contain the collection , Theorem 3.32 is valid for each of the aforementioned rings. Moreover, the ring is a Von-Neumann regular ring, for any topological space and hence it follows that is always a complemented graph and the space of minimal prime ideals of is compact, for any topological space .
4. Annihilator graph on
In this section, we discuss the annihilator graph on the ring . For simplicity, we write instead of when there is no ambiguity. Note that is a spanning subgraph of . We begin with a lemma, which was established by us in [8] and sketch its proof to make this article self-contained.
Lemma 4.1.
Let . Then if and only if .
Proof 4.2.
Suppose and . Then we have and so . Conversely let . Then there exists such that which implies that and so .
Now, we provide a way to check when two vertices in are adjacent to each other.
Theorem 4.3.
Let , then and are adjacent in if and only if and .
Proof 4.4.
Let . Then it can be easily observed that . Indeed, if , then , which is possible only if , that is and . Therefore, and are non-adjacent. Analogously, it can be shown that if , then also and are non-adjacent.
Conversely let and be non-adjacent. Then . Since the union of two ideals is an ideal if and only if one contains the other, it follows that or . The conclusion then follows from Lemma 4.1.
The next question that we address is when the graph equals .
Theorem 4.5.
The graphs and coincide if and only if .
Proof 4.6.
We first aim to show that if contains three distinct points, then and are unequal as graphs. Let be three distinct points in . Then, by Theorem 2.1, there exist such that and . It then follows that and . Therefore, and are adjacent in , but non-adjacent in , as . Now if , then , where and . See that for any and hence is a stable set in . Analogously, is a stable set in . The rest follows from Theorem 3.10 and the fact that is a spanning subgraph of .
The next corollary follows immediately using Theorem 3.10.
Corollary 4.7.
is a complete bipartite graph if and only if .
Our next aim is to compute the diameter of . We first establish a result describing the existence of a vertex adjacent to two distinct vertices in .
Theorem 4.8.
Let . Then there exists a vertex adjacent to both and in if and only if either on or and .
Proof 4.9.
First suppose that and choose . By Theorem 2.1, there exists such that . It is clear that and is adjacent to both and in . Now, let and and . If , then there exists a vertex adjacent to and in , and hence in . If not, then there exist distinct points and . By Theorem 2.1, there exists such that . It follows that and is adjacent to both and .
Finally, assume that and . Then , which is open in and so . Let be adjacent to in . Then which implies that . But , which implies that and are non-adjacent.
We obtain the following result as a corollary.
Corollary 4.10.
The distance between two non-adjacent vertices in is 2.
Proof 4.11.
Let be non-adjacent in . Then they are also non-adjacent in . Therefore, on . It follows from Theorem 4.8 that there exists , which is adjacent to both and . It follows that .
It is also evident from Theorem 4.8 that if , then and it follows from Corollary 4.10 that for any . Consequently, the following conclusions can be drawn about the graph .
Theorem 4.12.
In the graph , the following assertions hold.
-
1.
for any .
-
2.
-
3.
Each vertex is a center.
-
4.
Again, if and are vertices of an edge in which is not part of a triangle, then by Theorem 4.8, on and either or is a singleton set. In light of these arguments, we establish the following result.
Theorem 4.13.
is hypertriangulated if and only if and has no isolated points.
Proof 4.14.
Suppose that . Then there exists a point in such that . Therefore, and constitutes an edge in and by Theorem 4.8, this edge is not part of a triangle. Now, let be an isolated point in . Then and are in and again and constitutes an edge which is not a part of a triangle.
Conversely let be not hypertriangulated. Then there exists an edge joining vertices and which is not part of a triangle. Then by Theorem 4.8, and either or is a singleton set. Without loss of generality let Then there exists a basic open set in such that and so . But and so . Therefore, either is an isolated point in or .
Corollary 4.15.
is hypertriangulated if and only if has no isolated points.
We now address when is a triangulated graph.
Theorem 4.16.
The graph is triangulated if and only if .
Proof 4.17.
Suppose that and let . If is a singleton set, , then there exist distinct points . By Theorem 2.1, there exist such that and so with and adjacent in . Analogously, there exists with which is adjacent to as well. Moreover, and , which ensures that and are also adjacent. Thus, , and constitutes a triangle in . Now, if , then by Theorem 3.18 is a vertex of a triangle in and the rest follows from the fact that is a spanning subgraph of . The converse follows from Corollary 4.7.
We next address the question of complementation of the graph .
Theorem 4.18.
The following assertions are true for the graph .
-
1.
A pair of vertices are orthogonal if and only if on and either or is singleton.
-
2.
is a complemented graph if and only if .
Proof 4.19.
- 1.
- 2.
Theorem 4.20.
is a dominating set in if and only if on and .
Proof 4.21.
Suppose constitutes a dominating set in . If , then and is non-adjacent to both and . If , then and is non-adjacent to both and .
Conversely let there exist which is non-adjacent to both and in . Then there are four possibilities:
-
(i)
-
(ii)
-
(iii)
and
-
(iv)
and
The first three possibilities contradict the fact that . Now, assume the fourth possibility. Since , and . Thus, and so, . Therefore, , which contradicts the hypothesis.
We see that if , then there exists a point such that and the same thing happens when is an isolated point in . This observation leads to the following corollary.
Corollary 4.22.
if either or has an isolated point.
Corollary 4.23.
if and only if is not hypertriangulated.
5. Weakly zero-divisor graph on
The aim of this section is to study the weakly zero-divisor graph of . The following observation has been discussed in the introduction, in a more general setting. We state it explicitly for ease of reference.
Observation 5.1.
If denotes the spanning subgraph relation between two graphs over the same vertex set, then we have:
We next realise that the weakly zero-divisor graph and zero-divisor graph of coincide if and only if contains exactly two points. To see this, we first check what happens when .
Theorem 5.2.
If , is a complete bipartite graph and in this case, the graphs , and are equal.
Proof 5.3.
Note that a complete bipartite graph is uniquely complemented. This gives us the following corollary.
Corollary 5.4.
If , is a uniquely complemented graph.
Corollary 5.5.
The graphs and coincide if and only if .
In order to explore the condition under which coincides with , we establish the adjacency relation between two vertices in .
Theorem 5.6.
Two distinct vertices are adjacent in if and only if contains at least two points.
Proof 5.7.
First note that since and are zero-divisors, and . Now, assume that contains exactly one point . Then . If possible let there exist and such that . Then and where ; which is impossible as is a singleton set. Therefore, no such and can exist and so and are not adjacent.
Let us now suppose that contains at least two distinct points. Choose and such that . By Theorem 2.1, there exist such that . Again and so there exists such that . Therefore, we have , and . Hence, and are adjacent vertices.
Corollary 5.8.
If is such that contains at least two distinct points, then is adjacent to all other vertices in . That is, is a universal vertex.
By using Theorem 5.6, we realise when the graph coincides with the graph .
Theorem 5.9.
The graphs and coincide if and only if .
Proof 5.10.
Suppose are three distinct points in . By Theorem 2.1, there exists such that . Moreover, is a closed set in , which misses . Again, by Theorem 2.1, there exists such that . Therefore, and so and are not adjacent in . However, , where and so and adjacent in . Thus, is a proper (spanning) subgraph of . The rest follows from Observation 5.1 and Corollary 5.5.
Observe that if are such that for some , then is an isolated point in . Therefore, there exists a basic open set for some such that and hence on . Therefore, is adjacent to both and in . In this case, . Consequently, we have the following result.
Theorem 5.11.
For two distinct vertices ,
Corollary 5.12.
Moreover, it follows from Corollary 5.8 that if there exists with , then is a dominating set. If no such exists, then and hence is a complete bipartite graph. Thus, we have the following result.
Theorem 5.13.
The dominating number of is given by:
We now establish when this graph is a complete graph.
Theorem 5.14.
is a complete graph if and only if has no isolated points and .
Proof 5.15.
If is an isolated point in , then and are in and are non-adjacent. Now, let . Then by Lemma 2.4, . This implies that the functions and are in and are non-adjacent. Therefore, is not a complete graph. If has no isolated points and , then for each , consists of at least two points and so is adjacent to all other vertices. Therefore, is a complete graph.
The weakly zero-divisor graphs of the well-known rings , and are not complete. On the other hand, if is a connected topological space, then is a complete graph.
Corollary 5.16.
The following statements are equivalent.
-
1.
has no isolated points and .
-
2.
is triangulated.
-
3.
is a hypertriangulated graph.
-
4.
is a complete graph.
Next we proceed to discuss when is a triangulated graph.
Theorem 5.17.
The following assertions are equivalent.
-
(a)
-
(b)
is triangulated.
-
(c)
is hypertriangulated.
Proof 5.18.
If , then we have seen that is a complete bipartite graph, and so is neither triangulated nor hypertriangulated.
Let and . If , then , and constitute a triangle. Suppose , for some . Choose such that are distinct. Then there exist such that and , by Theorem 2.1 and Theorem 5.6, , and constitute a triangle. Again see that if form an edge, then contains atleast two points. If and with , then choose and such that . It then follows that , and are vertices of a triangle.
As a hypertriangulated graph cannot be complemented, the following result follows from Corollary 5.4.
Corollary 5.19.
is (uniquely) complemented if and only if .
The following conclusions can be drawn about the weakly zero-divisor graph of the ring .
Theorem 5.20.
The following assertions hold for a Tychonoff space .
-
1.
Two vertices in are adjacent if and only if contains at least two distinct points.
-
2.
A vertex is a universal vertex if and only if contains at least two distinct points.
-
3.
For , .
-
4.
-
5.
is a complete graph if and only if has no isolated points.
-
6.
The following statements are equivalent.
-
(i)
is triangulated.
-
(ii)
is hypertriangulated.
-
(iii)
is not complemented.
-
(iv)
.
-
(i)
Acknowledgements.
The first author is immensely grateful for the award of research fellowship provided by the University Grants Commission, New Delhi (NTA Ref. No. 221610014636).Funding.
This research has not received external funding.Author contributions.
Conceptualization, writing—original draft preparation, writing—review and editing, A.D., S.B. and D.M. All authors have read and agreed to the published version of the manuscript.References
- [1] D. F. Anderson and P. S. Livingston, The zero-divisor graph of a commutative ring, J. Algebra 217 (1999), 434–447.
- [2] M. R. Ahmadi Zand, An algebraic characterization of Blumberg spaces, Quaest. Math. 33, no. 2 (2010), 223–230.
- [3] F. Azarpanah, Essential ideals in , Period. Math. Hungar. 31, no. 2 (1995), 105–112.
- [4] F. Azarpanah and M. Motamedi, Zero-divisor graph of , Acta. Math, Hungar. 108, no. 1-2 (2005), 25–36.
- [5] A. Badawi, On the annihilator graph of a commutative ring, Comm. Algebra, 42, no. 1 (2013), 108–121.
- [6] R. Diestel, Graph Theory, Springer Berlin, Heidelberg, 5th Ed. (2017).
- [7] A. Dey, S. K. Acharyya, S. Bag and D. Mandal, Rings of functions whose closure of discontinuity set is in an ideal of closed sets, Filomat, 38, no. 27 (2024), 9537–9556.
- [8] A. Dey, S. Bag and D. Mandal, Algebraic properties of the ring , arXiv:2402.01356.
- [9] Z. Gharabaghi, M. Ghirati, and A. Taherifar, On the rings of functions which are discontinuous on a finite set, Houston J. Math. 44 (2018), 721–739.
- [10] L. Gillman and M. Jerison, Rings of Continuous Functions, Springer, London (1976).
- [11] M. Henriksen and M. Jerison, The space of minimal prime ideals of a commutative ring, Trans. Am. Math. Soc. 115 (1965), 110–130.
- [12] J. Kist, Minimal prime ideals in commutative semigroups, Proc. London Math. Soc. 13, no. 3 (1963), 31–50.
- [13] R. Levy, Almost -spaces, Can. J. Math. 29, no. 2 (1977), 284–288.
- [14] S. Mandal, S. Bag, and D. Mandal, Convergence and the zero-divisor graph on the ring of functions which are discontinuous on a finite set, Afr. Mat. 34 (2023), 43.
- [15] P. Nandi, S. K. Acharyya, and A. Deb Ray, Annihilator graph of the ring , arXiv.2206.05463.
- [16] M. J. Nikmehr, A. Azadi and R. Nikandish, The weakly zero-divisor graph of a commutative ring, Rev. Un. Mat. Argentina 62, no. 1 (2021), 105–116.