Abstract.

This article focuses on the study of zero-divisor graph Γ(C(X)𝒫), annihilator graph AG(C(X)𝒫) and weakly zero-divisor graph WΓ(C(X)𝒫) on the ring C(X)𝒫 of all real-valued functions on a topological space X that are continuous outside a member of an ideal 𝒫 of closed subsets of X. We establish that if C(X)𝒫 properly contains the ring C(X) of real-valued continuous functions on X, then the radius of Γ(C(X)𝒫) is 2 and it is not triangulated. Moreover, in this situation, both Γ(C(X)𝒫) and AG(C(X)𝒫) are not hypertriangulated and the dominating number of AG(C(X)𝒫) is 2. Furthermore, WΓ(C(X)𝒫) fails to be a complete graph under the hypothesis C(X)𝒫C(X). We establish a connection between the complemented-ness of Γ(C(X)𝒫) and the Von-Neumann regularity of C(X)𝒫 under the assumption that C(X)𝒫{χ{p}:pX}. We realise that any two of these three graphs coincide if and only if |X|=2 and in this case, the graphs are complete bipartite. We also note that the phenomena of WΓ(C(X)𝒫) being triangulated, hypertriangulated and complemented depend solely on the cardinality of X.

keywords:
zero-divisor graph; annihilator graph; weakly zero-divisor graph; triangulated; hypertriangulated; complemented.
MSC:
54C30; 54C40; 05C25.

1. Introduction

Let X be a Tychonoff space and C(X) denote the ring of real-valued continuous functions on X. Let the collection of all real-valued functions on X be denoted by X and for fX, the set of points of discontinuities of f by Df. As usual, the closure (interior) of a subset A of X is denoted by A¯ (resp. intA) in X. A collection 𝒫 of closed subsets of X is said to be an ‘ideal of closed sets’ if it satisfies the following conditions:

  1. (i)

    𝒫 is closed under taking finite union.

  2. (ii)

    If A,B are closed sets in X such that AB and B𝒫, then A𝒫.

The following collections form ideals of closed sets in X:

  • 𝒫f= the collection of all finite subsets of X,

  • 𝒦= the collection of all closed compact subsets of X and

  • 𝒫nd= the collection of all closed nowhere dense subsets of X.

The triplet (X,τ,𝒫) is called a τ𝒫-space ([7]) and the collection, C(X)𝒫={fX:Df¯𝒫} [7] forms a commutative ring with unity, under the operations of pointwise additions and multiplications. Note that the ring C(X)𝒫 is an abstraction of various known rings of functions.

  • If 𝒫={}, then C(X)𝒫=C(X).

  • If 𝒫=𝒫nd, then C(X)𝒫=T(X), which was introduced by Ahmadi Zand in 2010 [2].

  • If 𝒫=𝒫f, then C(X)𝒫=C(X)F, which was introduced by Gharabaghi et. al. in 2018 [9].

  • The notation C(X)K is used to denote C(X)𝒦 in [7].

For fC(X)𝒫, the ‘zero-set’, Z𝒫(f) is the set {xX:f(x)=0}. If fC(X), we write Z(f) instead of Z𝒫(f). The collection {Z(f):fC(X)} is as usual denoted by Z[X] and {Z𝒫(f):fC(X)𝒫} is denoted by Z𝒫[X].

On a commutative ring R, Anderson and Livingston defined the zero-divisor graph, Γ(R) on the vertex set V(R), consisting of all non-zero zero-divisors of the ring R and two vertices x and y in V(R) to be adjacent in Γ(R) if xy=0 [1]. In 2013, Badawi defined the annihilator graph AG(R) on the same vertex set V(R) such that two vertices x,yV(R) are adjacent if Ann(x)Ann(y)Ann(xy) [5], where Ann(z) denotes the collection {zR:zz=0} for zR. Another graph, called the weakly zero-divisor graph, denoted by WΓ(R), was defined on V(R) by Nikmehr et. al. [16]. Two distinct vertices x and y are adjacent in WΓ(R) if there exist non-zero elements aAnn(x) and bAnn(y) such that ab=𝟎. It follows that Γ(R) is a spanning subgraph of AG(R) and AG(R) is a spanning subgraph of WΓ(R). Recall that a graph G2 is said to be the spanning subgraph of a graph G1 if they have the same vertex set and whenever two vertices are adjacent in G2, they are also adjacent in G1.

In this article, we wish to study the above mentioned graphs defined on the collection V(C(X)𝒫) (or simply, V) of all non-zero divisors of zero of the ring C(X)𝒫. In order to do that efficiently, we first recollect some definitions. Let G be a graph defined on a vertex set V0. For f,gV0, the distance d(f,g) is the length of the shortest path between f and g. The diameter diam(G)=sup{d(f,g):f,gV0} and the girth gr(G) is the length of the shortest cycle in G. If G has no cycles, gr(G)=. Furthermore, for fV0, the associated number, e(f) of f is defined as max{d(f,g):gV0{f}}. An fV0 is said to be a center of G if it has the smallest associated number. The associated number of such a center is called the radius of G and is denoted by ρ(G). G is said to be triangulated if each vertex of G is a vertex of a triangle and hypertriangulated if each edge in G is an edge of a triangle. A subset of V0 is said to be a stable set if no two vertices in the set are adjacent. G is called a bipartite graph if V0 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 f,gV0, 𝒄(𝒇,𝒈) denotes the length of the shortest cycle (if any) containing f and g, and c(f,g)= if there does not exist any cycle in G containing f and g. Two distinct vertices f,gV0 are said to be orthogonal (denoted as 𝒇𝒈) if f is adjacent to g and there does not exist any hV0 which is adjacent to both f and g. G shall be called a complemented graph if for each fV0, there exists gV0 such that fg. A complemented graph G is called uniquely complemented if g,hV0 are adjacent to the same set of vertices in G, whenever fg and fh in G for some fV0. A vertex is said to be a universal vertex in G if it is adjacent to all other vertices. A subset V1 of V0 is said to be a dominating set in G if every vertex outside V1 is adjacent to some vertex in V1. The dominating number, 𝒅𝒕(𝑮)=min{|V1|:V1 is a dominating set in G}. The smallest cardinal number such that every complete subgraph of G is of cardinality is said to be the clique number of G, and is denoted by 𝝎𝑮. For more graph theoretic terms, one can refer [6].

We observe that if R has no non-zero divisors of zero, then V(R)= and all the three graphs Γ(R), AG(R) and WΓ(R) are then null-graphs. If X is a topological space with exactly one point, then C(X)𝒫 is isomorphic to , for any choice of ideal 𝒫 and hence all the above mentioned graphs on C(X)𝒫 are null-graphs. So, to avoid this case, we shall always assume |X|2.

Throughout this article, we have made use of the space X𝒫, which is generated by Z𝒫[X] as a base for closed sets. First note that if 𝒫={}, then the space X𝒫 is the original space X. We observe that the space X𝒫 is a T3 space. We also note that X𝒫 contains isolated points if either X has isolated points or C(X)𝒫C(X). Next we establish a relation between the Goldie dimension of the ring C(X)𝒫 and the cellularity of the space X𝒫. Furthermore, we describe the space of minimal prime ideals of C(X)𝒫 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 Γ(C(X)𝒫) (or simply, Γ) of the ring C(X)𝒫. 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 2 if C(X)𝒫C(X). Moreover, we have observed that if C(X)𝒫C(X), then Γ is neither triangulated nor hypertriangulated. This brings out a contrast between the zero-divisor graph of C(X) and Γ (see Example 3.23). We note that Γ is a complete bipartite graph if |X|=2. We further observe that the clique number of Γ and the Goldie dimension of C(X)𝒫 are equal. In particular, we explicitly show that the clique number of Γ(C(X)F), Γ(T(X)) and Γ(C(X)K) are equal and equal to the cardinality of X. We next establish that the compactness of the space of minimal prime ideals of C(X)𝒫 is equivalent to the complemented-ness of the graph Γ. We further recall a condition equivalent to the Von-Neumann regularity of the ring C(X)𝒫 (see [7]) to establish that if C(X)𝒫{χ{p}:pX}, then the complemented-ness of the graph Γ is equivalent to the Von-Neumann regularity of the ring C(X)𝒫.

Section 4 of this article deals with the annihilator graph AG(C(X)𝒫) of the ring C(X)𝒫. For simplicity, we write AG instead of AG(C(X)𝒫) when there is no ambiguity. We realise that AG coincides with Γ if and only if |X|=2 and then and only then AG is a complete bipartite graph. Moreover, we note that the distance between any two non-adjacent vertices is 2 and it follows that the diameter of the graph is 2. We further establish that AG is hypertriangulated if and only if C(X)𝒫=C(X) and X has no isolated points. However, AG is triangulated if and only if |X|3. We also observe a correspondence between the dominating number of AG and the phenomenon of AG being hypertriangulated.

The final section involves the weakly zero-divisor graph of the ring C(X)𝒫. We denote it by WΓ, instead of WΓ(C(X)𝒫). Just as we have seen in case of Γ and AG, WΓ is also a complete bipartite graph, which coincides with Γ and AG if and only if |X|=2. We are able to describe the distance between two vertices, diameter of WΓ and the dominating number of the graph. We further show that WΓ is a complete graph if and only if C(X)𝒫=C(X) and X has no isolated points. In particular, whenever C(X)𝒫 properly contains C(X), WΓ is not a complete graph. We realise that WΓ is triangulated if and only if |X|3 and this is equivalent to the hypertriangulation of WΓ as well. Moreover, the above statements are equivalent to saying that WΓ is not complemented. Finally, we describe some of these results for the particular case of C(X).

2. Prerequisites on the ring C(X)𝒫 and the space X𝒫

We initiate this section with the recollection that the set of all zero-sets of functions in C(X)𝒫, denoted by Z𝒫[X], forms a base for closed sets for the topology τ𝒫 on X, which is finer than the original topology on X [8]. In short we denote the pair (X,τ𝒫) as X𝒫. For a subset A of X, clX𝒫A (intX𝒫A) denotes the closure (resp. interior) of A in X𝒫. We first observe a topological property of the space X𝒫 which shall be useful throughout this article.

Theorem 2.1.

X𝒫 is a T3-topological space and the collection {intX𝒫Z𝒫(f):fC(X)𝒫} forms a base for open sets for the space X𝒫.

Proof 2.2.

Suppose K is a closed set in X𝒫 and x0K. Then there exists fC(X)𝒫 such that x0XZ𝒫(f)XK. Without loss of generality assume that f(x0)>0 and let r=f(x0)3. Define U={xX:f(x)<r} and V={xX:f(x)>r}. Then U and V are disjoint basic open sets in X𝒫 such that x0V and KU. This ensures that X𝒫 is a T3-space.

Moreover, there exist g,hC(X)𝒫 such that U=XZ𝒫(g) and V=XZ𝒫(h). Also since x0VXUXK, it follows that x0intX𝒫Z𝒫(g)XK.

The following observation helps us make certain compelling deductions regarding the rings C(X)F, T(X) and C(X)K.

Observation 2.3.

The assumption that the characteristic function χ{p}C(X)𝒫 for each pX (for eg.: C(X)F, C(X)K, T(X), etc) ensures that X{p}=Z𝒫(χ{p})Z𝒫[X], which is a base for closed sets X𝒫 and so X𝒫 is the discrete space. In this context,

Next, we note that often the existence of even a single function of the form χ{p}, for some pX, in C(X)𝒫 describes certain behaviours of graphs on the ring C(X)𝒫. Such an existence is clearly guaranteed if X has an isolated point. Moreover, we have the following useful lemma.

Lemma 2.4.

C(X)𝒫 contains χ{p} for some pX if and only if either X has an isolated point or there exists a non-isolated point pX with {p}𝒫. Moreover, the latter holds if and only if C(X)C(X)𝒫. In particular, a point pX is isolated in the space X𝒫 if and only if either p is an isolated point in X or {p}𝒫.

Proof 2.5.

If C(X)χ{p}, for some pX, then p is an isolated point in X. If χ{p}C(X)𝒫C(X), then p is a non-isolated point in X and so Dχ{p}={p}. Therefore, {p}𝒫. The converse is straightforward.

Moreover, if {p}𝒫, where p is non-isolated, then χ{p}C(X)𝒫C(X). Conversely let fC(X)𝒫C(X). Then DfDf¯𝒫. Let pDf, then it follows that p is a non-isolated point in X and {p}𝒫. The rest is immediate.

Recall that the cellularity c(X) of a space X is defined as the smallest cardinal number (0) such that every family of pairwise disjoint non-empty open subsets of X has cardinality and a cardinal number is called the Goldie dimension, dim(R) of a commutative ring R if a direct sum of non-zero ideals in R consists of m terms where m.

We now realise that the Goldie dimension, dim(C(X)𝒫) of C(X)𝒫 is closely related to the cellularity of the space X𝒫. This relation shall be useful in discussing the clique number of the zero-divisor graph of C(X)𝒫.

Theorem 2.6.

For a topological space X, dim(C(X)𝒫)=c(X𝒫).

Proof 2.7.

Let αΛIα be a direct sum of non-zero ideals in C(X)𝒫. Note that for α,βΛ with αβ, fαfβ=𝟎 as IαIβ={𝟎}. Thus, the collection {XZ𝒫(fα):αΛ} is a family of pairwise disjoint open sets in X𝒫. Thus, we have c(X𝒫)|Λ| and hence c(X𝒫)dim(C(X)𝒫).

Next suppose {Gi:iI} is a family of pairwise disjoint open subsets of X𝒫. Then for each iI, there exists fiC(X) such that XZ𝒫(fi)Gi. Set Ii=<fi> for each iI. We claim that the family {Ii:iI} of non-zero ideals in C(X)𝒫, constitutes an independent family. In other words, for iI, IijI{i}Ij=. Indeed, if fIijI{i}Ij, then f=fih=k=1mfjkhk, where j1,j2,,jmI{i} and h,hkC(X)𝒫 for k=1,2,,m. This ensures that f2=(fih)(k=1mfjkhk)=k=1mfifjkhhk=𝟎, since fifj=𝟎 for ij (as GiGj= for ij). Thus, we have a direct sum of ideals in C(X)𝒫, iIIi and so |I|dim(C(X)𝒫). It follows that c(X𝒫)dim(C(X)𝒫).

Next, we wish to discuss the compactness of the space of minimal prime ideals of C(X)𝒫.

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 R.

Lemma 2.8.

The intersection of all minimal prime ideals in R is the set of all nilpotent elements in R.

Lemma 2.9 ([12, Lemma 3.1]).

A prime ideal P of R is minimal if and only if for each xP, there exists aRP such that ax is a nilpotent element in R.

We borrow the notation, 𝒫(R) from [11] to denote the family of all minimal prime ideals of R.

Notations 2.10.
  • For any subset S of R, the hull h(S) of S is the collection of all minimal prime ideals of R that contain the set S.

  • For a subfamily of 𝒫(R), the kernel k() is the intersection of all members of .

It is easy to verify that 𝒫(R) becomes a topological space with the understanding that a set 𝒫(R) is closed if =h(k()).

The annihilator of a subset S of R, Ann(S) is defined as Ann(S)={yR:xy=0 for all xS}. A ring R is said to be reduced if it does not contain any non-zero nilpotents. Clearly, any subring of X is a reduced ring. A reduced ring R is said to satisfy the annihilator condition, and is said to be an a.c. ring if for x,yR, there exists zR such that Ann(x)Ann(y)=Ann(z) [4]. We observe that for f,gC(X)𝒫, Ann(f)Ann(g)=Ann(f2+g2). Therefore, C(X)𝒫 is an a.c. ring.

Theorem 2.11 ([11, Theorem 2.3]).

In a reduced ring R, for aR, h(a)=𝒫(R)h(Ann(a)).

Theorem 2.12 ([11, Theorem 2.7]).

If R is a reduced ring and SR, we have:

Ann(S)=kh(Ann(S))={P𝒫(R):Ann(S)P}
Lemma 2.13 ([11, Lemma 3.1]).

For x,yR, where R is a reduced ring, Ann(Ann(x))=Ann(y) if and only if h(x)=h(Ann(y)).

Theorem 2.14 ([11, Theorem 3.4]).

The following conditions are equivalent for a reduced ring R.

  1. (1)

    𝒫(R) is compact and R is an a.c. ring.

  2. (2)

    For xR, there exists yR such that Ann(Ann(y))=Ann(x). (Equivalently, For xR, there exists yR such that h(y)=h(Ann(x)).)

We use the above results to see when is 𝒫(C(X)𝒫) compact.

Theorem 2.15.

The space 𝒫(C(X)𝒫) is compact if and only if for each fC(X)𝒫 there exists gC(X)𝒫 such that Z𝒫(f)Z𝒫(g)=X and intX𝒫(Z𝒫(f)Z𝒫(g))=.

Proof 2.16.

Let us suppose that 𝒫(C(X)𝒫) is compact. Since C(X)𝒫 is an a.c. ring, it follows from Theorem 2.14 that for fC(X)𝒫, there exists gC(X)𝒫 such that h(g)=h(Ann(f)). Let P𝒫(C(X)𝒫) be such that Ann(f)P. Since h(Ann(f))=h(g), Ph(g) and it follows that gP. By Theorem 2.12, gAnn(f) and hence Z𝒫(f)Z𝒫(g)=X. Next note that h(g)=h(Ann(f)) implies that h(f)h(g)= since otherwise there exists a minimal prime ideal P of C(X)𝒫 containing both f and g. As gP, Ann(f)P. But it follows from Lemma 2.9 that there exists tAnn(f)P which is a not possible. Again, h(f)h(g)= implies that h(f2+g2)=. Indeed, if Ph(f2+g2), then f2+g2P. By Lemma 2.9, there exists tP such that (f2+g2)t=𝟎 and thus, ft=gt=𝟎. By Theorem 2.11 we get that f,gP and so Ph(f)h(g). By Theorem 2.11, h(Ann(f2+g2))=𝒫(C(X)𝒫)h(f2+g2) where h(f2+g2)=. So we have h(Ann(f2+g2))=𝒫(C(X)𝒫). Thus, Ann(f2+g2) is contained in the intersection of all minimal prime ideals of R. It then follows from Lemma 2.8 and the fact that C(X)𝒫 is a reduced ring that Ann(f2+g2)={𝟎}. It is then clear that intX𝒫Z𝒫(f2+g2)= which directly implies that intX𝒫(Z𝒫(f)Z𝒫(g))=.

Conversely let fC(X)𝒫. Then there exists gC(X)𝒫 such that Z𝒫(f)Z𝒫(g)=X and intX𝒫(Z𝒫(f)Z𝒫(g))=. It is sufficient to show that h(g)=h(Ann(f)) and the rest will follow from Theorem 2.15. Indeed, Z𝒫(f)Z𝒫(g)=X implies that fg=𝟎, that is gAnn(f) and so h(Ann(f))h(g). Next see that intX𝒫(Z𝒫(f)Z𝒫(g))= implies that intX𝒫Z𝒫(f2+g2)= and so Ann(f2+g2)={𝟎}. It follows that Ann(f2+g2) is contained in all minimal prime ideals of R and hence h(Ann(f2+g2))=𝒫(C(X)𝒫). It is now evident from Theorem 2.11 that h(f2+g2)=. Now, if Ph(g), then Ph(f). Indeed, if Ph(f)h(g), then f,gP and so f2+g2P which contradicts that h(f2+g2)=. Finally, it follows from Theorem 2.11 that Ph(Ann(f)). Thus, h(g)h(Ann(f)). This completes the proof.

The next corollary follows immediately using Observation 2.3.

Corollary 2.17.

If C(X)𝒫 contains the collection {χ{p}:pX}, then the space 𝒫(C(X)𝒫) is compact if and only if for each fC(X)𝒫 there exists gC(X)𝒫 such that Z𝒫(f)=XZ𝒫(g).

3. Zero-divisor graph of C(X)𝒫

The objective of this section is to discuss the zero-divisor graph Γ(C(X)𝒫) of the ring C(X)𝒫. We first characterise the zero-divisors of the ring C(X)𝒫.

Theorem 3.1.

An element fC(X)𝒫{𝟎} is a divisor of zero in the ring C(X)𝒫 if and only if intX𝒫Z𝒫(f).

Proof 3.2.

Suppose there exists gC(X)𝒫{𝟎} such that fg=𝟎. Then XZ𝒫(g)Z𝒫(f) and so intX𝒫Z𝒫(f). Conversely let xintX𝒫Z𝒫(f). Then there exists hC(X)𝒫 such that xXZ𝒫(h)intX𝒫Z𝒫(f) and so fh=𝟎 where h𝟎.

The above theorem ensures that the vertex set V of the three graphs which are under study in this article is given by:

V={fC(X)𝒫:intX𝒫Z𝒫(f)X}.

We aim to shed light on the distance between two vertices in Γ. To achieve this, we first establish a lemma.

Lemma 3.3.

For f,gV, there exists a vertex adjacent to both f and g if and only if intX𝒫Z𝒫(f)intX𝒫Z𝒫(g).

Proof 3.4.

Let xintX𝒫Z𝒫(f)intX𝒫Z𝒫(g). Then there exists hC(X)𝒫 such that xXZ𝒫(h)intX𝒫Z𝒫(f)intX𝒫Z𝒫(g). This ensures that hV and h is adjacent to both f and g. Conversely let there exist hV adjacent to both f and g. Then it follows that XZ𝒫(h)intX𝒫Z𝒫(f)intX𝒫Z𝒫(g).

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 f,gV,

  1. (i)

    d(f,g)=1 if and only if Z𝒫(f)Z𝒫(g)=X,

  2. (ii)

    d(f,g)=2 if and only if Z𝒫(f)Z𝒫(g)X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g),

  3. (iii)

    d(f,g)=3 if and only if Z𝒫(f)Z𝒫(g)X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=.

In order to calculate the diameter and girth of Γ, we need another lemma.

Lemma 3.6.

If X contains (at least) three distinct elements x,y and z, then there exists fC(X)𝒫 such that 0=f(x)<f(y)<f(z).

Proof 3.7.

Let A={x,y}, B={y,z} and C={z,x}. Then xXB, which is open in X, and hence in X𝒫. Thus, there exists gC(X)𝒫 such that xXZ𝒫(g)XB. Choose fx=1g(x)g. Then fx(x)=1 and fx(B)={0}. Similarly, there exist fy,fzC(X)𝒫 such that fy(y)=2, fz(z)=3 and fy(C)=0=fz(A). Finally, take f=fx+fy+fz𝟏.

Theorem 3.8.

If X is a topological space which contains at least three points, then the diam(Γ)=3 and gr(Γ)=3.

Proof 3.9.

Let X contain three distinct elements a,b and c. Then by Lemma 3.6, there exists fC(X)𝒫 such that 0=f(a)<f(b)<f(c). Choose r,s such that 0=f(a)<r<f(b)<s<f(c). We then have a{xX:f(x)<r}{xX:f(x)r} and c{xX:f(x)>s}{xX:f(x)s} where {xX:f(x)r} and {xX:f(x)s} (resp. {xX:f(x)<r} and {xX:f(x)>s}) are zero-sets (resp. cozero-sets) of functions in C(X)𝒫. Therefore, there exist f1,g1C(X)𝒫 such that Z𝒫(f1)={xX:f(x)r} and Z𝒫(g1)={xX:f(x)s} and we have Z𝒫(f1)Z𝒫(g1)= and bZ𝒫(f1)Z𝒫(g1). It follows from Theorem 3.5 that d(f1,g1)=3 and hence diam(Γ)=3.

Employing the steps used in the proof of Lemma 3.6, there exists hC(X)𝒫 such that h(x)=1, h(y)=0 and h(z)=1. Set Z𝒫(f2)={tX:h(t)12} and Z𝒫(g2)={tX:h(t)12} for some f2,g2C(X)𝒫. Then yZ𝒫(f2)Z𝒫(g2) which ensures that Z𝒫(f22+g22). Thus, f2,g2,f22,g22,f22+g22 are all non-zero zero-divisors in C(X)𝒫. Thus, there exists kC(X)𝒫 such that k(f22+g22)=𝟎 and so kf2=𝟎=kg2. Also see that XZ𝒫(f2)Z𝒫(g2) and so f2g2=𝟎. Therefore, k,f2,g2 constitutes a circle in Γ. Thus, gr(Γ)=3.

When |X|=2, the graph Γ is of a particular form.

Theorem 3.10.

The following statements are equivalent.

  1. 1.

    |X|=2.

  2. 2.

    Γ is a bipartite graph.

  3. 3.

    Γ is a complete bipartite graph.

Proof 3.11.

We note that if X={p,q}, then the vertex set V=PQ, where P={cχ{p}:c{0}} and Q={cχ{q}:c{0}}. It follows that P and Q are stable sets and each vertex in P is adjacent to each vertex in Q. This ensures that Γ is a complete bipartite graph.

Moreover, if |X|3, 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 X is a space with exactly two points, then diam(Γ)=2 and gr(Γ)=.

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 fV, e(f)={2ifXZ𝒫(f)isasingletonset3otherwise.

Proof 3.14.

Let fV and XZ𝒫(f)={p}. Let gV{f}. If xZ𝒫(g), then fg=𝟎 and hence d(f,g)=1. Again if xZ𝒫(g), then Z𝒫(g)Z𝒫(f). This shows that xZ𝒫(f)Z𝒫(g) and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=intX𝒫Z𝒫(g). It follows from Theorem 3.5 that d(f,g)=2. Therefore, e(f)=2.

Now, let there exist distinct points x and y in XZ𝒫(f). Then Z𝒫(f){x} is a closed set in X𝒫 and yZ𝒫(f){x}. Thus, by Theorem 2.1, there exists hC(X)𝒫 such that yintX𝒫Z𝒫(h)Z𝒫(h)X(Z𝒫(f){x}). This ensures that xZ𝒫(f)Z𝒫(h) and Z𝒫(f)Z𝒫(h)=. Therefore, we have from Theorem 3.5 that d(f,g)=3 and so e(f)=3.

Remark 3.15.

We realise that if C(X)𝒫 contains at least one f such that it is zero everywhere except exactly a single point, then ρ(Γ)=2. Recall that if 𝒫 contains all singleton subsets of X (e.g.: 𝒫f and 𝒦), then C(X)𝒫 contains functions of the form χ{p}. In such cases, ρ(Γ)=2. In particular, ρ(Γ(C(X)F))=2=ρ(Γ(C(X)K)) Moreover, recall that the ring T(X)=C(X)𝒫nd contains functions of the form χ{p} for each pX, even though 𝒫nd may not contain all singleton subsets of X. In conclusion, we have ρ(Γ(T(X)))=2.

The above remark prompts us to realise that the existence of χ{p} in C(X)𝒫, for even a single pX induces the radius of Γ to be 2. The following corollary is an immediate consequence of this apprehension and can be deduced using Lemma 2.4.

Corollary 3.16.

If C(X)C(X)𝒫, then ρ(Γ)=2.

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 |X|>1.

  1. (i)

    Γ(C(X)) is a triangulated graph if and only if X has no isolated points.

  2. (ii)

    Γ(C(X)) is a hypertriangulated graph if and only if X is a connected middle P-space, i.e., if every non-empty zero set ZZ[X] of the form Z=EF, where E,FZ[X] with EF=X, has a non-empty interior.

We now realise when is a vertex in Γ a part of a triangle.

Theorem 3.18.

Let fV. Then f is a vertex in a triangle if and only if |X|3 and |intX𝒫Z𝒫(f)|2.

Proof 3.19.

Suppose that |X|3 and x and y are two distinct points in intX𝒫Z𝒫(f). Then by Theorem 2.1, there exists gC(X)𝒫 such that xXZ𝒫(g)XintX𝒫Z𝒫(g)intX𝒫Z𝒫(f){y}. It is evident that gV and fg=𝟎. Also, yintX𝒫Z𝒫(f)intX𝒫Z𝒫(g) and so by Lemma 3.3, there exists a vertex hV such that h is adjacent to both f and g. Therefore, f, g and h form a triangle.

Conversely, let f be a vertex of a triangle. Then it follows from Theorem 3.10 that |X|3. Now let g,hV be such that fg=𝟎=gh=hf. Then (XZ𝒫(g))(XZ𝒫(h))intX𝒫Z𝒫(f). Since gh=𝟎, (XZ𝒫(g))(XZ𝒫(h))= and hence |intX𝒫Z𝒫(f)|2.

We achieve something more general and concrete when C(X)𝒫 contains C(X) properly.

Theorem 3.20.

If C(X)C(X)𝒫, then Γ is neither triangulated nor hypertriangulated.

Proof 3.21.

Since C(X)C(X)𝒫, by Lemma 2.4, there exists a non-isolated pX such that {p}𝒫 and hence f=χ{p} and g=χX{p} are in V. It follows from Theorem 3.18 that g is not a vertex of a triangle and the edge joining f and g is not an edge of a triangle.

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, C(X)𝒫 must be equal to C(X). Moreover, we can make the following conclusions by implementing Theorem 3.17.

  1. (i)

    Γ is triangulated if and only if C(X)𝒫=C(X) and X has no isolated points.

  2. (ii)

    Γ is hypertriangulated if and only if C(X)𝒫=C(X) and X is a connected middle P-space.

In particular, if X is a connected middle P-space with no isolated points, then note that Γ(C(X)) is both triangulated and hypertriangulated but Γ is neither triangulated nor hypertriangulated, when C(X)𝒫C(X). We state an example to support our remark.

Example 3.23.

Let s denote the set of all {0,1}-valued transfinite sequences and the set of all upper elements of s is denoted by Q. Then the Dedekind completion, R of Q (see [10]) is a connected almost P-space (and hence a middle P-space) (see [13]). Thus, Γ(C(R)) is both triangulated and hypertriangulated; and if 𝒫{}, then Γ(C(R)𝒫) is neither triangulated nor hypertriangulated.

In particular, Γ(C(R)F) (See [14]) (resp. Γ(T(R)) and Γ(C(R)K)) is neither triangulated nor hypertriangulated.

Next we discuss the length of a cycle in Γ containing two specific vertices f,gV, which can be proved by following closely the proof of Proposition 2.2 in [4].

Theorem 3.24.

For a topological space X and f,gV, the following assertions are true.

  1. (i)

    c(f,g)=3 if and only if Z𝒫(f)Z𝒫(g)=X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g).

  2. (ii)

    c(f,g)=4 if and only if Z𝒫(f)Z𝒫(g)X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g) or Z𝒫(f)Z𝒫(g)=X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=.

  3. (iii)

    c(f,g)=6 if and only if Z𝒫(f)Z𝒫(g)X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=.

At this point we recall Observation 2.3 to obtain the following remark.

Remark 3.25.

If {χ{p}:pX}C(X)𝒫 and f,gC(X)𝒫, we have

  1. (i)

    c(f,g)=3 if and only if Z𝒫(f)Z𝒫(g)=X and Z𝒫(f)Z𝒫(g).

  2. (ii)

    c(f,g)=4 if and only if either Z𝒫(f)Z𝒫(g)X and Z𝒫(f)Z𝒫(g) or Z𝒫(f)Z𝒫(g)=X and Z𝒫(f)Z𝒫(g)=. In particular, if XZ𝒫(f)=Z𝒫(g), then c(f,g)=4.

  3. (iii)

    c(f,g)=6 if and only if Z𝒫(f)XZ𝒫(g) or Z𝒫(g)XZ𝒫(f).

We now realise that clique number of Γ coincides with the cellularity of X𝒫, and hence also with dim(C(X)𝒫).

Theorem 3.26.

For a τ𝒫-space (X,τ,𝒫), c(X𝒫)=ωΓ=dim(C(X)𝒫).

Proof 3.27.

Suppose H is a complete subgraph of Γ. Then for f,gH, fg=0 and so XZ𝒫(f)XZ𝒫(g)=. Hence the family, {XZ𝒫(f):fH} is a collection of pairwise disjoint open sets in X𝒫. It follows that |H|c(X𝒫) and since H is an arbitrary complete subgraph of Γ, ωΓc(X𝒫)

Conversely let be a collection of pairwise disjoint non-empty open subsets of X𝒫. For A and pA, there exists h1C(X)𝒫 such that pXZ𝒫(h1)A. Fix hA=1h1(p)h1. Then hA(p)=1 and hA(XA)={0}. Let H={hA:A}. Then each member of H is a non-zero zero-divisor in C(X)𝒫 and for each A,B, fAfB=𝟎 as AB=. Therefore, H is a complete subgraph of Γ. Thus, we have ||=|H|ωΓ and as is an arbitrary collection of pairwise disjoint non-empty open subsets of X𝒫, c(X𝒫)ωΓ. The last equality follows directly from Theorem 2.6.

The following remark is obvious from Observation 2.3.

Remark 3.28.

If C(X)𝒫 contains the collection {χ{p}:pX}, then dim(C(X)𝒫)=ωΓ is nothing but the cardinality of X,|X|.

In particular, dim(C(X)F)=|X|=dim(C(X)K)=dim(T(X)) and ωΓ(C(X)F)=|X|=ωΓ(C(X)K)=ωΓ(T(X)).

We now proceed to discuss when is Γ a complemented graph. Recall that two vertices f,gV are orthogonal if and only if they are adjacent and there is no vertex hV which is adjacent to both f and g. It follows now from Lemma 3.3 and Theorem 3.5(i) that f,gV are orthogonal if and only if Z𝒫(f)Z𝒫(g)=X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=. The following theorem is now immediate.

Theorem 3.29.

Γ is a complemented graph if and only if for each fV, there exists gΓ such that Z𝒫(f)Z𝒫(g)=X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=.

The following corollary is now immediate with the assistance of Theorem 2.15.

Corollary 3.30.

The zero-divisor graph Γ of the ring C(X)𝒫 is a complemented graph if and only if the space of minimal prime ideals 𝒫(C(X)𝒫), of C(X)𝒫 is compact.

An interesting characterisation of C(X)𝒫 as a Von-Neumann regular ring can be achieved using the above theories, provided C(X)𝒫 contains the collection {χ{p}:pX}. A ring R is said to be Von-Neumann regular if for each aR, there exists xR such that a=axa. We first recall the following result.

Theorem 3.31 ([7, Theorem 5.7]).

A τ𝒫-space, (X,τ,𝒫) is a 𝒫P-space (i.e., C(X)𝒫 is a Von-Neumann regular ring) if and only if for fC(X)𝒫, there exists gC(X)𝒫 with Z𝒫(f)=XZ𝒫(g).

The next observation follows directly by using the above discussions and Observation 2.3.

Theorem 3.32.

Consider a τ𝒫-space (X,τ,𝒫) such that C(X)𝒫{χ{p}:pX}. Then the following statements are equivalent.

  1. (1)

    The zero-divisor graph Γ of C(X)𝒫 is a complemented graph.

  2. (2)

    The space of minimal prime ideals 𝒫(C(X)𝒫) of C(X)𝒫 is compact.

  3. (3)

    C(X)𝒫 is a Von-Neumann regular ring.

Remark 3.33.

Since the rings C(X)F [9], C(X)K [7] and T(X) [2] all contain the collection {χ{p}:pX}, Theorem 3.32 is valid for each of the aforementioned rings. Moreover, the ring T(X) is a Von-Neumann regular ring, for any topological space X and hence it follows that Γ(T(X)) is always a complemented graph and the space of minimal prime ideals of T(X) is compact, for any topological space X.

4. Annihilator graph on C(X)𝒫

In this section, we discuss the annihilator graph on the ring C(X)𝒫. For simplicity, we write AG instead of AG(C(X)𝒫) when there is no ambiguity. Note that Γ is a spanning subgraph of AG. 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 f,gC(X)𝒫. Then intX𝒫(Z𝒫(f))intX𝒫(Z𝒫(g)) if and only if Ann(f)Ann(g).

Proof 4.2.

Suppose intX𝒫(Z𝒫(f))intX𝒫(Z𝒫(g)) and hAnn(f). Then we have XZ𝒫(h)intX𝒫(Z𝒫(f))intX𝒫(Z𝒫(g))Z𝒫(g) and so hAnn(g). Conversely let xintX𝒫(Z𝒫(f)). Then there exists hC(X)𝒫 such that xXZ𝒫(h)intX𝒫(Z𝒫(f)) which implies that hAnn(f)Ann(g) and so xXZ𝒫(h)intX𝒫(Z𝒫(g)).

Now, we provide a way to check when two vertices in AG are adjacent to each other.

Theorem 4.3.

Let f,gV, then f and g are adjacent in AG if and only if intX𝒫Z𝒫(f)intX𝒫Z𝒫(g) and intX𝒫Z𝒫(g)intX𝒫Z𝒫(f).

Proof 4.4.

Let intX𝒫Z𝒫(f)intX𝒫Z𝒫(g). Then it can be easily observed that Ann(fg)=Ann(f)Ann(g). Indeed, if hAnn(fg), then XZ(gh)intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)Z𝒫(g)Z𝒫(fg), which is possible only if Z𝒫(gh)=X, that is gh=𝟎 and hAnn(g)Ann(f)Ann(g). Therefore, f and g are non-adjacent. Analogously, it can be shown that if intX𝒫Z𝒫(g)intX𝒫Z𝒫(f), then also f and g are non-adjacent.

Conversely let f and g be non-adjacent. Then Ann(f)Ann(g)=Ann(fg). Since the union of two ideals is an ideal if and only if one contains the other, it follows that Ann(f)Ann(g) or Ann(g)Ann(f). The conclusion then follows from Lemma 4.1.

The next question that we address is when the graph AG equals Γ.

Theorem 4.5.

The graphs AG and Γ coincide if and only if |X|2.

Proof 4.6.

We first aim to show that if X contains three distinct points, then AG and Γ are unequal as graphs. Let x,y,z be three distinct points in X. Then, by Theorem 2.1, there exist f,gC(X)𝒫 such that {x,y}XZ𝒫(f)clX𝒫(XZ𝒫(f))X{z} and {x,z}XZ𝒫(g)clX𝒫(XZ𝒫(g))X{y}. It then follows that yintX𝒫Z𝒫(g)intX𝒫Z𝒫(f) and zintX𝒫Z𝒫(f)intX𝒫Z𝒫(g). Therefore, f and g are adjacent in AG, but non-adjacent in Γ, as x(Z𝒫(f)Z𝒫(g)). Now if X={p,q}, then V=PQ, where P={cχ{p}:c{0}} and Q={dχ{q}:d{0}}. See that Ann(cχ{p})=Ann(χ{p}) for any c{0} and hence P is a stable set in AG. Analogously, Q is a stable set in AG. The rest follows from Theorem 3.10 and the fact that Γ is a spanning subgraph of AG.

The next corollary follows immediately using Theorem 3.10.

Corollary 4.7.

AG is a complete bipartite graph if and only if |X|=2.

Our next aim is to compute the diameter of AG. We first establish a result describing the existence of a vertex adjacent to two distinct vertices in AG.

Theorem 4.8.

Let f,gV. Then there exists a vertex adjacent to both f and g in AG if and only if either fg𝟎 on X or |intX𝒫Z𝒫(f)|2 and |intX𝒫Z𝒫(g)|2.

Proof 4.9.

First suppose that fg𝟎 and choose xXZ𝒫(fg). By Theorem 2.1, there exists hC(X)𝒫 such that xintX𝒫Z𝒫(h)XZ𝒫(fg)X. It is clear that hV and is adjacent to both f and g in AG. Now, let fg=𝟎 and |intX𝒫Z𝒫(f)|2 and |intX𝒫Z𝒫(g)|2. If intX𝒫Z𝒫(f)intX𝒫Z𝒫(g), then there exists a vertex adjacent to f and g in Γ, and hence in AG. If not, then there exist distinct points x,yintX𝒫Z𝒫(f) and z,wintX𝒫Z𝒫(g). By Theorem 2.1, there exists hC(X)𝒫 such that {x,z}intX𝒫Z𝒫(h)X{y,w}. It follows that hV and is adjacent to both f and g.

Finally, assume that fg=𝟎 and intX𝒫Z𝒫(f)={x}. Then Z𝒫(g)=X{x}, which is open in X𝒫 and so intX𝒫Z𝒫(g)=X{x}. Let hV be adjacent to g in AG. Then intX𝒫Z𝒫(g)intX𝒫Z𝒫(h) which implies that xintX𝒫Z𝒫(h). But intX𝒫Z𝒫(f)={x}intX𝒫Z𝒫(h), which implies that f and h are non-adjacent.

We obtain the following result as a corollary.

Corollary 4.10.

The distance between two non-adjacent vertices in AG is 2.

Proof 4.11.

Let f,gV be non-adjacent in AG. Then they are also non-adjacent in Γ. Therefore, fg𝟎 on X. It follows from Theorem 4.8 that there exists hV, which is adjacent to both f and g. It follows that d(f,g)=2.

It is also evident from Theorem 4.8 that if fV, then d(f,2f)=2 and it follows from Corollary 4.10 that e(f)2 for any fV. Consequently, the following conclusions can be drawn about the graph AG.

Theorem 4.12.

In the graph AG, the following assertions hold.

  1. 1.

    e(f)=2 for any fV.

  2. 2.

    ρ(AG)=2

  3. 3.

    Each vertex fV is a center.

  4. 4.

    diam(AG)=2

Again, if f and g are vertices of an edge in AG which is not part of a triangle, then by Theorem 4.8, fg=𝟎 on X and either intX𝒫Z𝒫(f) or intX𝒫Z𝒫(g) is a singleton set. In light of these arguments, we establish the following result.

Theorem 4.13.

AG is hypertriangulated if and only if C(X)𝒫=C(X) and X has no isolated points.

Proof 4.14.

Suppose that C(X)C(X)𝒫. Then there exists a point p in X such that {p}𝒫. Therefore, χ{p} and χX{p} constitutes an edge in AG and by Theorem 4.8, this edge is not part of a triangle. Now, let p be an isolated point in X. Then χ{p} and χX{p} are in C(X) and again χ{p} and χX{p} constitutes an edge which is not a part of a triangle.

Conversely let AG be not hypertriangulated. Then there exists an edge joining vertices f and g which is not part of a triangle. Then by Theorem 4.8, fg=𝟎 and either intX𝒫Z𝒫(f) or intX𝒫Z𝒫(g) is a singleton set. Without loss of generality let intX𝒫Z𝒫(f)={p}. Then there exists a basic open set XZ𝒫(h) in X𝒫 such that pXZ𝒫(h)intX𝒫Z𝒫(f)={p} and so XZ𝒫(h)={p}. But h=h(p)χ{p} and so χ{p}C(X)𝒫. Therefore, either p is an isolated point in X or χ{p}C(X)𝒫C(X).

The next result, which was already established in [15], also follows from Theorem 4.13.

Corollary 4.15.

AG(C(X)) is hypertriangulated if and only if X has no isolated points.

We now address when is AG a triangulated graph.

Theorem 4.16.

The graph AG is triangulated if and only if |X|3.

Proof 4.17.

Suppose that |X|3 and let fV. If intX𝒫Z𝒫(f) is a singleton set, {x}, then there exist distinct points y,zX{x}. By Theorem 2.1, there exist g,hC(X)𝒫 such that zintX𝒫Z𝒫(g)X{x,y} and so gV with f and g adjacent in AG. Analogously, there exists hV with yintX𝒫Z𝒫(h)X{x,z} which is adjacent to f as well. Moreover, yintX𝒫Z𝒫(h)intX𝒫Z𝒫(g) and zintX𝒫Z𝒫(g)intX𝒫Z𝒫(h), which ensures that g and h are also adjacent. Thus, f, g and h constitutes a triangle in AG. Now, if |intX𝒫Z𝒫(f)|2, then by Theorem 3.18 f is a vertex of a triangle in Γ and the rest follows from the fact that Γ is a spanning subgraph of AG. The converse follows from Corollary 4.7.

We next address the question of complementation of the graph AG.

Theorem 4.18.

The following assertions are true for the graph AG.

  1. 1.

    A pair of vertices f,gV are orthogonal if and only if fg=𝟎 on X and either intX𝒫Z𝒫(f) or intX𝒫Z𝒫(g) is singleton.

  2. 2.

    AG is a complemented graph if and only if |X|3.

Proof 4.19.
  1. 1.

    If fg, then f and g are adjacent and there does not exist any vertex adjacent to both. By Theorem 4.8, fg=𝟎 and either intX𝒫Z𝒫(f) or intX𝒫Z𝒫(g) is singleton. Conversely let f,gV be such that fg=𝟎 and either intX𝒫Z𝒫(f) or intX𝒫Z𝒫(g) is singleton. Therefore, f and g are adjacent in Γ, and hence in AG and by Theorem 4.8, there is no vertex adjacent to both f and g.

  2. 2.

    By Corollary 4.7, AG is complemented if |X|=2. Let |X|=3 and fV. Then either Z𝒫(f) or XZ𝒫(f) is singleton. It follows that χZ𝒫(f)V and by the above result, fχZ𝒫(f). Finally, let |X|4 and x,y,z,w be four distinct points in X. By Theorem 2.1, there exists fV such that {x,y}intX𝒫Z𝒫(f)Z𝒫(f)X{z,w}. If possible let there exist gV such that fg. Then XZ𝒫(f)intX𝒫Z𝒫(g) which implies that {z,w}intX𝒫Z𝒫(g). This contradicts that fg.

Theorem 4.20.

{f,g}V is a dominating set in AG if and only if fg=𝟎 on X and intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=.

Proof 4.21.

Suppose {f,g} constitutes a dominating set in AG. If fg𝟎, then fgV and is non-adjacent to both f and g. If intX𝒫Z𝒫(f)intX𝒫Z𝒫(g), then f2+g2V and is non-adjacent to both f and g.

Conversely let there exist hV which is non-adjacent to both f and g in AG. Then there are four possibilities:

  1. (i)

    intX𝒫Z𝒫(f)intX𝒫Z𝒫(h)intX𝒫Z𝒫(g)

  2. (ii)

    intX𝒫Z𝒫(g)intX𝒫Z𝒫(h)intX𝒫Z𝒫(f)

  3. (iii)

    intX𝒫Z𝒫(h)intX𝒫Z𝒫(f) and intX𝒫Z𝒫(h)intX𝒫Z𝒫(g)

  4. (iv)

    intX𝒫Z𝒫(f)intX𝒫Z𝒫(h) and intX𝒫Z𝒫(g)intX𝒫Z𝒫(h)

The first three possibilities contradict the fact that intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)=. Now, assume the fourth possibility. Since fg=𝟎, XZ𝒫(f)intX𝒫Z𝒫(g)intX𝒫Z𝒫(h) and XZ𝒫(g)intX𝒫Z𝒫(f)intX𝒫Z𝒫(h). Thus, XZ𝒫(f)XZ𝒫(g)intX𝒫Z𝒫(h) and so, XZ𝒫(h)XintX𝒫Z𝒫(h)Z𝒫(f)Z𝒫(g). Therefore, intX𝒫Z𝒫(f)intX𝒫Z𝒫(g), which contradicts the hypothesis.

We see that if C(X)C(X)𝒫, then there exists a point pX such that χ{p},χX{p}C(X)𝒫 and the same thing happens when p is an isolated point in X. This observation leads to the following corollary.

Corollary 4.22.

dt(AG)=2 if either C(X)C(X)𝒫 or X has an isolated point.

The following corollary follows from Lemma 3.3, Theorem 4.20 and Corollary 4.22.

Corollary 4.23.

dt(AG)=2 if and only if Γ is not hypertriangulated.

5. Weakly zero-divisor graph on C(X)𝒫

The aim of this section is to study the weakly zero-divisor graph WΓ of C(X)𝒫. 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:

ΓAGWΓ.

We next realise that the weakly zero-divisor graph and zero-divisor graph of C(X)𝒫 coincide if and only if X contains exactly two points. To see this, we first check what happens when |X|=2.

Theorem 5.2.

If |X|=2, WΓ is a complete bipartite graph and in this case, the graphs WΓ, AG and Γ are equal.

Proof 5.3.

If X={p,q}, then V=PQ, where P={cχ{p}:c{0}} and Q={cχ{q}:c{0}}. Note that for any fP, Ann(f)=Q{𝟎} and for gQ, Ann(g)=P{𝟎} and thus P and Q are stable sets in WΓ. Therefore, WΓ is a complete bipartite graph. Moreover, it has been noted in Theorem 3.10 and Corollary 4.7 that the same structure is exhibited by Γ and AG as well. Therefore, the three graphs coincide.

Note that a complete bipartite graph is uniquely complemented. This gives us the following corollary.

Corollary 5.4.

If |X|=2, WΓ is a uniquely complemented graph.

The following corollary follows from Observation 5.1, Theorem 5.2 and Theorem 4.5.

Corollary 5.5.

The graphs WΓ and Γ coincide if and only if |X|=2.

In order to explore the condition under which AG coincides with WΓ, we establish the adjacency relation between two vertices in WΓ.

Theorem 5.6.

Two distinct vertices f,gV are adjacent in WΓ if and only if intX𝒫Z𝒫(f)intX𝒫Z𝒫(g) contains at least two points.

Proof 5.7.

First note that since f and g are zero-divisors, intX𝒫Z𝒫(f) and intX𝒫Z𝒫(g). Now, assume that intX𝒫Z𝒫(f)intX𝒫Z𝒫(g) contains exactly one point p. Then intX𝒫Z𝒫(f)=intX𝒫Z𝒫(g)={p}. If possible let there exist hAnn(f){𝟎} and kAnn(g){𝟎} such that hk=𝟎. Then XZ𝒫(h)intX𝒫Z𝒫(f) and XZ𝒫(k)intX𝒫Z𝒫(g) where XZ𝒫(h)XZ𝒫(k)=; which is impossible as intX𝒫Z𝒫(f)=intX𝒫Z𝒫(g) is a singleton set. Therefore, no such h and k can exist and so f and g are not adjacent.

Let us now suppose that intX𝒫Z𝒫(f)intX𝒫Z𝒫(g) contains at least two distinct points. Choose xintX𝒫Z𝒫(f) and yintX𝒫Z𝒫(g) such that xy. By Theorem 2.1, there exist h,kC(X)𝒫 such that xXZ𝒫(h)clX𝒫(XZ𝒫(h))intX𝒫Z𝒫(f){y}. Again yintX𝒫Z𝒫(g)clX𝒫(XZ𝒫(h)) and so there exists kC(X)𝒫 such that yXZ𝒫(k)intX𝒫Z𝒫(g)clX𝒫(XZ𝒫(h)). Therefore, we have hAnn(f){𝟎}, kAnn(g){𝟎} and hk=𝟎. Hence, f and g are adjacent vertices.

Corollary 5.8.

If fV is such that intX𝒫Z𝒫(f) contains at least two distinct points, then f is adjacent to all other vertices in WΓ. That is, f is a universal vertex.

By using Theorem 5.6, we realise when the graph WΓ coincides with the graph AG.

Theorem 5.9.

The graphs AG and WΓ coincide if and only if |X|2.

Proof 5.10.

Suppose x,y,z are three distinct points in X. By Theorem 2.1, there exists fC(X)𝒫 such that {x,y}XZ𝒫(f)clX𝒫(XZ𝒫(f))X{z}. Moreover, Z𝒫(f){y} is a closed set in X𝒫, which misses x. Again, by Theorem 2.1, there exists gC(X)𝒫 such that xXZ𝒫(g)clX𝒫(XZ𝒫(g))X(Z𝒫(f){y}). Therefore, intX𝒫Z𝒫(f)Z𝒫(f)intX𝒫Z𝒫(g) and so f and g are not adjacent in AG. However, {y,z}intX𝒫Z𝒫(f)intX𝒫Z𝒫(g), where yz and so f and g adjacent in WΓ. Thus, AG is a proper (spanning) subgraph of WΓ. The rest follows from Observation 5.1 and Corollary 5.5.

Observe that if f,gV are such that intX𝒫Z𝒫(f)=intX𝒫Z𝒫(g)={p} for some pX, then p is an isolated point in X𝒫. Therefore, there exists a basic open set XZ𝒫(h) for some hC(X)𝒫 such that XZ𝒫(h)={p} and hence fh=gh=𝟎 on X. Therefore, h is adjacent to both f and g in WΓ. In this case, d(f,g)=2. Consequently, we have the following result.

Theorem 5.11.

For two distinct vertices f,gV,

d(f,g)={1if|intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)|22if|intX𝒫Z𝒫(f)intX𝒫Z𝒫(g)|=1,
Corollary 5.12.

diam(WΓ)={1if X𝒫 has no isolated points2 otherwise.

Moreover, it follows from Corollary 5.8 that if there exists fC(X)𝒫 with |intX𝒫Z𝒫(f)|2, then {f} is a dominating set. If no such f exists, then |X|=2 and hence WΓ is a complete bipartite graph. Thus, we have the following result.

Theorem 5.13.

The dominating number of WΓ is given by:

dt(WΓ)={1if|X|32otherwise.

We now establish when this graph is a complete graph.

Theorem 5.14.

WΓ is a complete graph if and only if X has no isolated points and C(X)𝒫=C(X).

Proof 5.15.

If pX is an isolated point in X, then f=χX{p} and 2f are in V and are non-adjacent. Now, let fC(X)𝒫C(X). Then by Lemma 2.4, {p}𝒫. This implies that the functions f=χX{p} and 2f are in V and are non-adjacent. Therefore, WΓ is not a complete graph. If X has no isolated points and C(X)𝒫=C(X), then for each fV, intX𝒫Z𝒫(f) consists of at least two points and so is adjacent to all other vertices. Therefore, WΓ is a complete graph.

{examples}

The weakly zero-divisor graphs of the well-known rings C(X)F, C(X)K and T(X) are not complete. On the other hand, if X is a connected topological space, then WΓ(C(X)) is a complete graph.

Moreover, the following corollary is immediate from Remark 3.22 and Theorem 4.13.

Corollary 5.16.

The following statements are equivalent.

  1. 1.

    X has no isolated points and C(X)𝒫=C(X).

  2. 2.

    Γ is triangulated.

  3. 3.

    AG is a hypertriangulated graph.

  4. 4.

    WΓ is a complete graph.

Next we proceed to discuss when is WΓ a triangulated graph.

Theorem 5.17.

The following assertions are equivalent.

  1. (a)

    |X|3

  2. (b)

    WΓ is triangulated.

  3. (c)

    WΓ is hypertriangulated.

Proof 5.18.

If |X|=2, then we have seen that WΓ is a complete bipartite graph, and so is neither triangulated nor hypertriangulated.

Let |X|3 and fV. If |intX𝒫Z𝒫(f)|2, then f, 2f and 3f constitute a triangle. Suppose intX𝒫Z𝒫(f)={x}, for some xX. Choose y,zX such that x,y,z are distinct. Then there exist g,hC(X)𝒫 such that yintX𝒫Z𝒫(g) and zintX𝒫Z𝒫(h), by Theorem 2.1 and Theorem 5.6, f, g and h constitute a triangle. Again see that if f,gV form an edge, then intX𝒫Z𝒫(f)intX𝒫Z𝒫(g) contains atleast two points. If xintX𝒫Z𝒫(f) and yintX𝒫Z𝒫(g) with xy, then choose zX{x,y} and hC(X)𝒫 such that zintX𝒫Z𝒫(h). It then follows that f, g and h are vertices of a triangle.

As a hypertriangulated graph cannot be complemented, the following result follows from Corollary 5.4.

Corollary 5.19.

WΓ is (uniquely) complemented if and only if |X|2.

The following conclusions can be drawn about the weakly zero-divisor graph WΓ(C(X)) of the ring C(X).

Theorem 5.20.

The following assertions hold for a Tychonoff space X.

  1. 1.

    Two vertices f,g in WΓ(C(X)) are adjacent if and only if intZ(f)intZ(g) contains at least two distinct points.

  2. 2.

    A vertex fWΓ(C(X)) is a universal vertex if and only if intZ(f) contains at least two distinct points.

  3. 3.

    For f,gWΓ(C(X)), d(f,g)={1if|intZ(f)intZ(g)|22if|intZ(f)intZ(g)|=1.

  4. 4.

    diam(WΓ(C(X)))={1if X has no isolated points2 otherwise.

  5. 5.

    WΓ(C(X)) is a complete graph if and only if X has no isolated points.

  6. 6.

    The following statements are equivalent.

    1. (i)

      WΓ(C(X)) is triangulated.

    2. (ii)

      WΓ(C(X)) is hypertriangulated.

    3. (iii)

      WΓ(C(X)) is not complemented.

    4. (iv)

      |X|3.

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 C(X), Period. Math. Hungar. 31, no. 2 (1995), 105–112.
  • [4] F. Azarpanah and M. Motamedi, Zero-divisor graph of C(X), 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 C(X)𝒫, 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 P-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 C𝒫(X), 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.