781
Views
0
CrossRef citations to date
0
Altmetric
Articles

Zero-divisor graphs of unitary R-modules over commutative rings

, ORCID Icon &
Pages 69-73 | Received 06 Jan 2022, Accepted 23 Mar 2022, Published online: 21 Apr 2022

Abstract

Let R be a commutative ring with unity 10 and let M be a unitary Rmodule. In this paper, we derive some completeness conditions on the zero divisor graphs of modules over commutative rings. It is shown that the weak zero divisor graph of a simple Rmodule is complete if and only if R is a field. We investigate the zero divisor graphs in finitely generated Rmodules. We find the diameter, the girth, the clique number and the vertex degrees of the zero-divisor graphs of the rings of integer modulo n as Zmodules.

AMS SUBJECT CLASSIFICATION:

1. Introduction

A simple graph G consists of a vertex set V(G) and an edge set E(G) of unordered pairs of distinct vertices. The cardinality of V(G) is called the order of G and the cardinality of E(G) is its size. A graph G is connected if and only if there exists a path between every pair of vertices u and v. A graph on n vertices such that every pair of distinct vertices is joined by an edge is called a complete graph, denoted by Kn. A complete subgraph of G of largest order is called a maximal clique of G and its order is called the clique number of G, denoted by cl(G). The number of edges incident on a vertex v is called the degree of v and is denoted by dv or d(v). A vertex of degree 1 is called a pendent vertex. In a connected graph G, the distance between two vertices u and v is the length of the shortest path between u and v. The diameter of a graph G is defined as diam(G)=max{(d(u,v)| u,vV(G))}, where d(u, v) denotes the distance between vertices u and v of G. For more definitions and terminology of graph theory, we refer to [Citation9].

Throughout, R shall denote a commutative ring with unity 10. Let Z(R) be the set of zero-divisors of R. The concept of the zero-divisor graph of a commutative ring was first introduced by Beck [Citation4]. The zero-divisor graph Γ(R) associated to a ring R has its vertices as elements of Z*(R)=Z(R)\{0} and two vertices x,yZ*(R) are adjacent if and only if xy = 0.

We denote a unitary Rmodule by M, unless otherwise stated. For an Rmodule M and xM, the set [x:M]={rR:rMRx}, is clearly an ideal of R and an annihilator of the factor module M/Rx. The annihilator of M denoted by ann(M) is [0:M]. The concept of the zero-divisor graph has been extended to modules over rings, see for instance, [Citation5, Citation10, Citation11]. Further, Ghalandarzadeh and Rad [Citation6] extended the notion of the zero-divisor graph to the torsion graph associated with a module M over a ring R, whose vertices are the non-zero torsion elements of M such that two distinct vertices a and b are adjacent if and only if (a:M)(b:M)M=0. The idea was extended to other graph structures, like the zero-divisor graphs of idealizations with respect to the prime modules [Citation2], the L-total graph of an L-module [Citation1], etc, to mention a few.

For any set X, let |X| denote the cardinality of X and X* denote the set of the non-zero elements of X. We denote an empty set by and the complement of X shall be denoted by Xc. We denote the ring of integers by Z, the ring of integer modulo n by Zn and the finite field with q elements by Fq. For more definitions and terminology of module and ring theory, we refer to [Citation3, Citation7].

The rest of the paper is organized as follows. In Section 2, we include some completeness conditions of the zero-divisor graph of the unitary Rmodules. For instance, it is shown that the zero divisor graph of MM is complete for every simple module M. In Section 3, we investigate some graph parameters of the zero-divisor graphs of the modules like the diameter, the girth, the clique number and the vertex degrees.

2. Graphs associated with modules over commutative rings

Throughout, we treat M as a unitary Rmodule. Let NM. We define the annihilator of N by (0:N)={rR|for all mM, rm=0}. For mM, we denote the annihilator of the factor module M/Rm by mM. Thus, mM:={rR|rMmR}. Let z be an element in M. The following definition is due to Behboodi [Citation5]. An element zM is a

  1. weak zero divisor, if either z = 0 or zMzMM=0 for some 0zM with zMR;

  2. zero divisor, if either z = 0 or 0zM and zMzMM=0 for some 0zM with 0zMR;

  3. strong zero divisor, if either z = 0 or (0:RM)zM and zMzMM=0 for some 0zM with 0zMR.

For any Rmodule M, we write Zw(M), Z(M) and Zs(M), respectively, for the set of non-zero weak zero divisors, non-zero zero divisors and non-zero strong zero divisors. Clearly, Zs(M)Z(M)Zw(M) and all of these sets coincide with the set of zero divisors of R when M = R. Behboodi [Citation5] associated three simple graphs, denoted by Γw(M), Γ(M) and Γs(M), called the weak zero-divisor graph, zero-divisor graph and strong zero-divisor graph, to an Rmodule M with vertex sets defined as Zw(M), Z(M) and Zs(M), respectively. Two distinct vertices zM and zM being adjacent if and only if zMzMM=0. From the definition, clearly Γw(M)Γ(M)Γs(M) as induced subgraphs.

Behboodi [Citation5] showed that for any Rmodule M, either Γw(M)=Γ(M) or Γ(M)=Γs(M) and also, Γs(M) is always connected with diameter at most 3. Moreover, if Γs(M) is not a tree, then the girth of Γs(M) is at most 4. Further, characterized the Rmodules M for which Γw(M)=Γ(M)=Γs(M) and showed that such a property is only enjoyed by the multiplication modules. Whenever, Γw(M)=Γ(M)=Γs(M), we shall write Γz(M) with vertex set Zz(M). Behboodi showed that the weak zero-divisor graph of a module M is finite if and only if either M is finite or prime multiplication-like module.

Example 2.1.

Let R=Z and M=Z3×Z4. Then M consists of 12 elements as an Rmodule. As M is a multiplication-like module, we have Γw(M)=Γ(M)=Γs(M). Also, we have Zz(M)={(0,1)M, (0,2)M, (0,3)M, (1,2)M, (2,0)M, (2,2)M, (1,0)M}. Further, it can be verified that (0,1)M=3Z=(0,3)M,(0,2)M=6Z,(1,2)M=2Z=(2,2)M,(2,0)M=4Z=(1,0)M. Now, let M=Z2×Z2. Then Zs(M)=,Z(M)=Zw(M)=M{(0,0)}. For any z,zM{(0,0)}, we have zMzMM=0. The zero divisor graphs of M and M are given in .

Figure 1. Γz(Z3×Z4) and Γw(Z2×Z2)=Γ(Z2×Z2).

Figure 1. Γz(Z3×Z4) and Γw(Z2×Z2)=Γ(Z2×Z2).

If X is a subset of a module M over a ring R, then the intersection of all submodules of M containing X is called the submodule generated by X (or spanned by X). If X is finite, and X generates the module M, then M is said to be finitely generated. If X=, then X clearly generates the zero module. If X consists of a single element, say, X={a}, then the submodule generated by X is called the cyclic (sub)module generated by a. Finally, if {Mi|iI} is a family of submodules of M, then the submodule generated by X=iIMi is called the sum of the modules Mi. If the index set I is finite, the sum of M1,M2,,Mn is denoted by M1+M2++Mn. A non zero module M is said to be simple if it has no submodules other than (0) and M.

The following theorem provides a condition for the adjacency of two distinct vertices in the zero divisor graph of a finitely generated module.

Theorem 2.2.

Let M1,M2,,Mk, be a sequence of finitely generated simple Rmodules and let M=iNMi. Then xMyMM=0 if and only if xR and yR are disjoint Rmodules.

Proof.

Let xMyMM=0. Assume to the contrary and let 0zRxRy. Then, the submodule generated by z is given as <z>=MkRxRy. So there exist subsets N1 and N2 of N such that Rx=iN1Mi and Ry=jN2Mj. Therefore, we can write M=Rx(jN2Mj)=Ry(iN1Mi). In this notation, we have yM=yRy(iN1Mi)=(0:iN1Mi)=iN1(0:Mi)  and RxiN2cMi.

Thus, we have (0:Rx) =(0:x) =(0:iN2cMi)=iN2c(0:Mi). Since xMyMM=0, we have yM(0:x). This implies that iN1(0:Mi)(0:iN2cMi).

Now, since each Mt, tN is simple and Mt1Mt2 for all t1t2, we conclude that (0:Mt1) and (0:Mt2) are coprime. Therefore, we can write (2.1) iN1(0:Mi)=iN1(0:Mi)iN2c(0:Mi)(0:Mt)for all tN2c.(2.1)

This implies that for every pN2c, there exists qN1 such that (0:Mq)(0:Mp). Therefore, (0:Mq)=(0:Mp) and so Mq = Mp. Finally, MkRx=iN2c. So there exists sN2c such that Mk = Ms. As in EquationEquation (2.1), there exists tN2c such that Mk=Ms=Mt. Thus, MkRy(iN1Mi)=(0). This implies that z = 0, which is contradicts the hypothesis. On the other hand, since xMyMMRxRy, we conclude that RxRy=(0), which implies that xMyMM=0.

The following lemma will be used in the sequel.

Lemma 2.3.

[Proposition 5.3.4, [Citation8]] An Rmodule M is simple if and only if MR/a for some maximal ideal a in R.

An Rmodule M is said to be decomposable if there exist two non-zero submodules M1 and M2 such that M=M1M2 and indecomposable if it is not a direct sum of two non-zero submodules. The following theorem shows that the zero divisor graph of a simple R-module is complete.

Theorem 2.4.

If M is a simple Rmodule, then Γw(MM) is complete.

Proof.

Let M be a simple Rmodule, and let M=MM. By definition, (0,m)M=(0:M) for every 0mM. Therefore, for each (m,m)M, we have (m,m)M(0,m)MM=0. Similarly, (m,m)M(m,0)MM=0. Now, for each m1,m2M{0}, we have (0:m1)=(0:m2)=(0:M). By Lemma 2.3, we see that (0:M) is a maximal ideal of R, which is contained in (m1,m2)M. Now, if (m1,m2)M(0:M), we are done. Otherwise, 1(m1,m2)M, which gives (m1,0)1(m1,m2)R. Therefore, there exists rR such that m1=m1r and m2r=0. Thus, r(0:m2)=(0:m1), which implies that m1r=0. Therefore m1=0, a contradiction. Thus we have (0:M)=(m1,m2)M, and so Γw(M) is complete. □

Let R=Z and M=Zp×Zp××Zp (ncopies of Zp). Then (z1,z2, ,zn)M =pZ if some zi = 0 and some zj0 for some 1ijn and (1,1,,1)M=Z. Thus, the strong zero divisor graph of M is empty and that Γ(M)=Γw(M)Kpn1.

As seen above, Γw(Zp×Zp) is complete when M=Zp×Zp is considered as a Zmodule. However, the same does not hold true in general for all non-simple modules M when the ring R is chosen arbitrarily. The following theorem restricts the choice for the ring R for a module M to have a complete zero divisor graph.

Theorem 2.5.

Let M be an Rmodule which is not simple. Then Γw(M) is complete if and only if R is a field.

Proof.

As M is not simple, there exists an Rsubmodule M such that (0)MM. Let 0yxM for some xM. Then yMxR. This implies that My1xRxR, which is a contradiction. Therefore, xM=0. Thus, for all x,yM{0}, we have xMyMM=0. Conversely. assume that xMyMM=0 for all xM,yMZw(M). Let N be a proper ideal of R. Consider M=RNR and let m=(r̂1,r1), m=(r̂1,r1), where r̂1,r̂1RN and r1,r1R. Choose rR{0,1}. As NR, we have (0,r)MNrR. Because (0,r1)M(0,r1)MM=0 for every r1,r1R, we have rN = 0 for every rR{0,1}. This also implies that (1r)N=0 and hence N=rN=(0).

Let M be a Zmodule. Let z be a non-zero weak zero divisor in M. Then zM=nZ for some nN. It is trivial to see that |nZmZ|2 for all mN. Also, Zw(M)={0} if and only if M is a simple Zmodule. Since every finite module M is a finite abelian group, so we have the following proposition.

Proposition 2.6.

A vertex in a weak zero divisor graph of a finite Zmodule M represents an essential ideal if and only if M is a non-simple finite group.

Let M=Z×n (n copies of Z) be a Zmodule. Then it is easy to see that each non-zero element of M is a weak zero divisor and that for all z,zZw(M), we have zMzMM=0. Therefore, Γw(M)=K|M|1. Now, the submodules generated by the non-zero weak zero divisors of M are the lines with integral coordinates in the hyperplane R×n intersecting at the origin only. It follows that for every non-zero weak zero divisor m of M the ideal {zZ|zMmZ} is not an essential ideal. This shows that Proposition 2.6 is not true for infinite modules.

Theorem 2.7.

Let R be an integral domain and M an Rmodule. If there exists an element mM such that (0:m)=0, then Γw(MR) is complete.

Proof.

Choose 0rR and mM. Let z(r,m)M. Then (0,m)z=(r,m)r for some rR. This gives rr=0, which implies that r=0, since R is a domain. This further implies that z = 0 because mz=rr and (0:m)=0. Therefore, for each 0rR and mM, we have (r,m)M=0. Further, let 0mM and choose z(0,m)M. Then (1,0)z=(0,m)r for some rR. This gives z=0 and so (0,m)M=0. Therefore, Γw(MR) is complete. □

Definition 2.8.

Let R be a ring and M be an Rmodule. If for every non-zero submodule N of M and an ideal A of R with NA = 0 implies MA = 0, we say that M is a prime module. This is equivalent to saying that (0:M)=(0:N) for every non-zero submodule N of M. It is immediate that (0:M) is a prime ideal, and it is called the affiliated prime of M. Also, if each submodule of M is of the form AM for some ideal A of R, then we say that M is a multiplication module. Moreover, if a multiplication module M satisfies (0:M)(0:M/N) for every non-zero submodule N of M, then M is called a multiplication-like module.

Theorem 2.9.

Let M be a multiplication module over a ring R. Then the zero divisor graph of M is empty if and only if M is a prime multiplication-like module.

Proof.

Since every multiplication module is a multiplication-like module, therefore it suffices to prove the result for multiplication-like modules. Assume that M is not a prime multiplication-like module. We will show that Γw(M) is non-empty. As M is not a prime multiplication-like module, we have (0:M) is not a prime ideal. Thus, there exist ideals a and b which properly contain (0:M) and satisfy aM0,bM0 and abM=0. Thus, we can find 0aaM and 0bbM such that aMaRaM and bMbRbM. Then, we have aMbMabM=0. Therefore, Γ(M)0.

On the other hand, if M is a prime multiplication-like module, then (0:M)mM for every non-zero mM, that is, for each non-zero m,mM, we have mMmMM0. Therefore, Γw(M)=ϕ.

3. Graph parameters of zero divisor graphs of modules

In the following theorem, we compute the clique number of the zero divisor graph of a multiplication module. Noting that the weak zero divisor graph, the zero divisor graph and the strong zero divisor graph all coincide in case of multiplication-like modules, we write Γz(M) to denote the zero divisor graph of such modules.

Theorem 3.1.

Let M be an Rmodule, where R=Z and M=Zpt for tN and a prime p. Then the clique number of Γz(M) is equal to pt21 or pt12 according as t is even or odd.

Proof.

It follows immediately that every vertex of Γz(M) is of the form rp for some rR. We divide the vertex set of Γz(M) into disjoint subsets Z1,Z2,,Zt1, where Zk={rpk|pr}. It is not difficult to see that the cardinality of Zk as a subset of V(Γz(M)) is equal to (p1)pnk1, 1kt1. Let u=rpk1 and u=rpk2 be two vertices of Γz(M). Then uMuMM=0 if and only if k1+k2n. Thus, for all v,vMs, we have vMvMM=0 for all integers st2. Now, assume that t is even. Then wMwMM0 for all wZs ,1st2 and wZt2. Also, when t is odd, no two vertices are adjacent inside Z[t2] and every vertex of Z[t2] is adjacent to every vertex of Zt2. Therefore, it follows that cl(Γz(M))=p[t2]1, when t is even and is equal to p[t2], when t is odd. □

The girth of a graph G is defined as the length (or order) of the smallest cycle contained in G, and is denoted by gr(G). If G has no cycle, then gr(G)=. The following theorem characterizes the diameter, the smallest (dδ) and the largest (dΔ) vertex degree and the girth of the zero divisor graph of a Zmodule M.

Theorem 3.2.

Let p be a prime integer and tN{1}. Then for an Rmodule M, where R=Z and M=Zpt, the following statements hold, unless t=p=2.

  1. diam(Γz(M)=2

  2. dδ(Γz(M)=1 and dΔ(Γz(M)=pt12.

  3. gr(Γz(M)= if and only if t = 4, 8, 9, otherwise gr(Γz(M)=3.

Proof.

As in the proof of Theorem 3.1, we define Zk={rpk|pr}. Then Z1,Z2,,Zt1 gives a partition of the vertex set of Γz(M) and Zk=(p1)ptk1, 1kt1. Now, two elements m=r1pk and m=r2pl of M satisfy mMmMM=0 if and only if k+lt. Therefore, it follows instantly that every vertex uV(Γz(M)) is adjacent to every vertex contained in Zt1. Thus, diam(Γz(M))=2. Further, let nZ1 and choose nV(Γz(M)). Then nMnMM=0 if and only if nZt1. Thus, it follows that δ(Γz(M))=p1 and that Δ(Γz(M))=pt12. This proves (1) and (2).

(3) From the previous paragraph, we see that for all aZt1,d(a,b)=1 for all vertices ba of Γz(M). Also, if cZ1, then d(c,e)=1 only if eZt1. Thus, the set of elements in Zt1 form the center of Γz(M). Now, assume that Γz(M) is a tree. Then Γz(M) has either one or two centres. Therefore, |Zt1| must be either 1 or 2, so that p= 2 or 3. Now, either z1p23z2p2z3p3z1p2 or z2p2z1p2z3p2z1p form a triangle in Γz(M) for all z1,z2,z3,z1,z2,z3R and pt{4,8,9}. Therefore, the result follows. □

Corollary 3.3.

gr(Γz(M)= if and only if Γz(M) is a star graph, where M=Zpt, tN, is considered a Zmodule.

Let M=Zp×Zq, where p and q are distinct primes, be a Zmodule. Then, it can be easily verified that (z1,z2)M=pZ, if z1=0z2; (z1,z2)M=qZ, if z2=0z1, and (z1,z2)M=Z, if z10z2. Thus, Γz(M) is complete bipartite. While one expects that if p1,p2,,pt,t3, are distinct primes, and M=Zp1×Zp2××Zpt then Γz(M) is complete t partite, but this is not a case. However, Γz(M) contains the so expected t partite graph as a subgraph as can be seen in Γz(Z2×Z3×Z5) in which, (0,1,1)M=(0,1,2)M=(0,1,3)M=(0,1,4)M=(0,2,1)M=(0,2,2)M=(0,2,3)M=(0,2,4)M=2Z,(1,0,1)M=(1,0,2)M=(1,0,3)M=(1,0,4)M=3Z,(1,1,0)M=(1,2,0)M=5Z,(0,0,1)M=(0,0,2)M=(0,0,3)M=(0,0,4)M=6Z,(0,1,0)M=(0,2,0)M = 10Z and (1,0,0)M=15Z, so that deg((0,1,1)M)=1,deg((1,0,1)M)=2,deg((1,1,0)M)=4,deg((0,0,1)M)=5 deg((0,1,0)M)=9,deg((1,0,0)M)=14, thus containing six different vertex degrees. However, a complete t partite graph can possess at most t distinct vertex degrees. Therefore, Γz(Z2×Z3×Z5) is not complete t partite, but we see that the subsets V1={(0,0,1)M, (0,0,2)M, (0,0,3)M, (0,0,4)M},V2={(0,1,0)M,(0,2,0)M} and V3={(1,0,0)M} of the vertex set of Γz(Z2×Z3×Z5) induce a complete 3 partite subgraph.

If p, q, r are distinct primes and M=Zp×Zq×Zr be a Zmodule, then it is always possible to partition the vertex of Γz(M) into six disjoint sets, say, Vi, 1i6, where Vis are defined in the following way. Let up,uq,ur denote the arbitrary non-zero elements in Zp,Zq and Zr, respectively. Then V1={(up,0,0)M},V2={(0,uq,0)M},V3={(0,0,ur)M},V4={(up,uq,0)M},V5={(up,0,ur)M} and V6={(0,uq,ur)M}. Let x(i)Vi. Then it is an easy exercise to verify that xM(1)=qrZ,xM(2)=prZ,xM(3)=pqZ,xM(4)=rZ,xM(5)=qZ and xM(6)=pZ. Thus, it can be easily seen that deg(xM(i)), for 1i6 is an element of the ordered set {p1,q1,r1,pq1,pr1,qr1}. Moreover, the clique number of Γz(M) is 3 and the sets V4,V5 and V6 induce a complete 3 partite subgraph. In fact, this can be generalized to the following theorem.

Theorem 3.4.

Let M be an Rmodule, where M=Zp1×Zp2×Zpt and R=Z, then

  1. cl(Γz(M))=3.

  2. deg((x1,x2,,xt)M)=p1p2ptΠpi1, where i runs over the indices of xis in (x1,x2,,xt)M which are equal to 0.

  3. The set of vertices Vi={(x1,x2,,xi1,0,xi+1,,xt)M|xiZpi} induces a complete t partite subgraph in Γz(M).

Theorem 3.5.

Let M and N be two Rmodules such that the sum of their annihilators equals R. Then the following statements hold.

  1. If Γw(M)=Γw(N)=, then cl(Γ(MN))=2.

  2. If Γw(M)= and Γw(N), then cl(Γw(MN))=cl(Γw(N))+1.

  3. If Γw(M) and Γw(N), then cl(Γw(MN)) =cl(Γw(M)) +cl(Γ(N)) +η1η2, where η1,η2 denotes the number of elements η in cliques of Γw(M) and Γw(N), respectively, whose square is 0.

Proof.

For any Rmodule M, let Zw(M) and Zw*(M) denote the set of weak zero divisors and non-zero weak zero divisors of M. Let M and N be two Rmodules, m1,m2M and n1,n2N and MN=M.

  1. Assume that Zw(M)=Zw(N)={0}. Then for each m1,m2M and n1,n2N, we have (m1,0)M(m2,0)MM0,(0,n1)M(0,n2)MM0 and (m1,0)M(0,n1)MM=0. Thus, cl(Γ(MN))=2.

  2. As Γw(N), we have Zw(N)(0). Let K={k1,k2,,kt} be an induced maximal clique in Γw(N). Then, for each nZw*(N)K, there exists some kiK such that nNkiNN0. Now, for each (m,0),(0,n)MN, we have (m,0)M(0,n)MM=0 and for all mM{0} and nN, we have (m,0)M(m,n)MM0. Thus, the vertices of the form (m,0) contribute 1 to the clique number and the fact that Γw(M)=, we conclude that cl(Γw(MN))=1+cl(Γw(N)).

  3. Let Zw(M){0} and Zw(N){0}. Let KM={k1,k2,,kt1} and KN= {l1, l2, , lt2} be the induced maximal complete subgraphs of Γw(M) and Γw(N). Then, for each mZw*(M)KM and nZw*(N)KN, we can find kiKM, 1it1 and kjKN, 1jt2 which satisfy (m,0)(ki,0)M0 and (0,n)M(0,kj)MM0. Also, for every m1M{0} and n1N{0}, there exist no m1MZw*(M) and n1NZw*(N) for which (m1,n1)M(m1,n1)MM=0 holds true. Even if m1 (or equivalently m1) is chosen from M, then a similar statement holds true if n1Nn1NN0 (or equivalently n1Nn1NN0). A similar argument is valid for n1,n1 if chosen from N. Thus, such vertices do not contribute to the clique number. Now, for all mM and nN, we have (m,0)M(0,n)MM=0, but however such a vertex, say (m,0), contributes to the clique if and only if mKM and mMmMM=0. This argument adds each vertex kKM and kKN which satisfy kMkMM=0 and kNkNN=0 to the clique. Therefore, the clique number of Γw(MN) is equal to cl(Γw(M))+cl(Γw(N))+η1η2, where η1 and η2 are the number of vertices k(1)KM and k(2)KN, respectively, which satisfy kM(1)kM(1)M=0 and kN(2)kN(2)N=0

Theorem 3.6.

Let R be a finite integral domain and M be an Rmodule which is not simple. Then cl(Γw(M))=|M|1.

Proof.

The proof follows by Theorem 2.5. □

Theorem 3.7.

Let M=Zp1a1p2a2ptat be a Zmodule, where p1,p2,,pt are distinct primes. Then the clique number of Γz(M) is equal to t, if a1=a2==at=1. In case ai=2bi, then the clique number of Γz(M) is p1b1p2b2ptbt1.

Proof.

Let n=p1p2pt. Define ni=npi, 1it, and choose ziZni. Then ziMzjMM=0 for all ij. Therefore, contains a clique of order t. Moreover, if mZninj, then xiMmMM0 for all xiM. Hence, cl(Γz(M))=t. Now, let m=p1b1p2b2ptbt. Then mM and we have mMmMM=0. Consider the submodules Zm,Z2m,,Z(m1)m, then we have ziMzjMM=0 for all ziZi and zjZj, where i,j={m,2m,,(m1)m}. Moreover, let Zk be a submodule of M, where k{m,2m,,(m1)m}. Then k is of the form p1c1p2c2ptct, where some ci < bi. Without loss of generality, let c1<b1 and let zZk, then we get zMzMM0 where z is an element of Zm. Therefore, the clique number is equal to p1b1p2b2ptbt1.

Data availibility

Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.

Acknowledgments

We are grateful to the anonymous referee for his useful suggestions.

Additional information

Funding

The research of S. Pirzada is supported by the SERB-DST research project number CRG/2020/000109.

References

  • R. E, A. (2011). The L-total graph of an l-module. Int. Sch. Res. Notices 2011: 10. Article No. 491936.
  • Atani, S. E, Sarvandi, Z. E. (2007). Zero-divisor graphs of idealizations with respect to prime modules. Ijcms. 2(26): 1279–1283.
  • Atiyah, M. F, MacDonald, I. G. (1969). Introduction to Commutative Algebra. Reading, MA: Addison-Wesley.
  • Beck, I. (1988). Coloring of commutative rings. J. Algebra 116(1): 208–226.
  • Behboodi, M. (2012). Zero divisor graphs of modules over commutative rings. J. Comm. Algebra 4(2): 175–197.
  • Ghalandarzadeh, S, Rad, P. M. (2009). Torsion graph over multiplication modules. Extracta Math. 24(3): 281–299.
  • Kaplansky, I. (1974). Commutative Rings. Rev. ed. Chicago: Univ. of Chicago Press.
  • Musili, C. (2018). Introduction to Rings and Module. 2nd revised ed. New Delhi: Narosa Publishing House Pvt. Ltd.
  • Pirzada, S. (2012). An Introduction to Graph Theory. Orient Blackswan, Hyderabad, India: Universities Press.
  • Pirzada, S, Raja, R. (2016). On graphs associated with modules over commutative rings. J. Korean Math. Soc. 53(5): 1167–1182.
  • Raja, R, Pirzada, S. (2022). On annihilating graphs associated with modules over commutative rings. Algebra Colloq. 29(2) in press.