1,438
Views
1
CrossRef citations to date
0
Altmetric
Review

Wiener index of graphs over rings: a survey

ORCID Icon, , &
Pages 316-324 | Received 01 Mar 2022, Accepted 17 Oct 2022, Published online: 04 Nov 2022

Abstract

This article presents a survey of results consisting of the Wiener index of graphs associated with commutative rings. In particular, we focus on zero-divisor graphs, unit graphs, total graphs and prime graphs. Further, we have posed some open problems corresponding to the graphs considered.

2000 Mathematics Subject Classification:

1. Introduction

Topological indices have received special attention in mathematical chemistry. These are invariants which can be calculated from the underlying molecular graphs and exhibit good correlations with physical and chemical properties of the corresponding molecules. Molecules and molecular compounds are often modeled by the molecular graph. A molecular graph is a representation of the structural formula of a chemical compound in terms of graph theory, whose vertices correspond to the atoms of the compound and edges correspond to chemical bonds. Topological indices are used for correlation analysis in theoretical chemisty, pharmacology, toxicology, and environmental chemistry. There are two major classes of topological indices namely distance-based topological indices and degree-based topological indices of graphs. Among these, the classes of distance-based topological indices play a vital role in chemical graph theory. One of the well studied distance-based topological index is called Wiener index of graph.

1.1. Wiener index of graphs

The Wiener index was introduced by Harold Wiener [Citation38] in 1947. Wiener index has remarkable variety of chemical applications. Wiener himself used it to predict boiling point of parafin. He named this index as path number. Later on, the path number was renamed as the Wiener index. The Wiener index is considered as one of the most used topological indices which highly correlates many physical and chemical properties of molecular compounds. In particular, the Wiener index has a variety of applications in pharmaceutical science and in the structure of nanotubes. For results and applications of Wiener index, see [Citation14,Citation17]. Based on this interest on Wiener index some other topological indices have also been discovered. The mathematical representation of Wiener index was given by Hosoya in [Citation18].

The distance between vertices u, v of a graph G, denoted by dG(u,v), is the length of the shortest path in G beginning at u and ending at v. Then the Wiener index of a connected graph G is defined by, W(G)=12uV(G)d(u|G) where d(u|G) is the distance of a vertex u of a graph, d(u|G)=vV(G)d(u,v).

The hyper-Wiener index of acyclic graphs was introduced by Milan Randic in 1993 [Citation31], as a generalization of the Wiener index. Then, in 1995, Klein et al. [Citation20] generalized the hyper-Wiener index concept to all the connected graphs. The hyper-Wiener index of a graph G is defined as HW(G)=12u,vV(G)dG(u,v)+12u,vV(G)dG2(u,v)

1.2. Graphs associated to rings

In the past three decades, graphs constructed from algebraic structures have been studied extensively by many authors and have become a major field of research. The idea of constructing a graph from an algebraic structure was introduced by Arthur Cayley in 1878. He constructed a graph from groups. Another important graph construction is the construction of graphs from rings. The study of graphs from rings contributes to the interplay between the ring structure and the derived graph structure. One can sometimes translate algebraic properties of commutative rings to graph-theoretic language, and then the geometric properties of the graphs can help explore some interesting results related to commutative rings. The study of graphs from rings starts from the most well-studied zero-divisor graphs from commutative rings. The other well-studied graphs on the subject concentrated in this article are total graphs, unit graphs and prime graphs. For more details on graphs from rings, one may refer [Citation4].

1.3. Notation

Throughout the article, R will be a commutative ring with identity 10. We denote Z(R), U(R) and Nil(R) to indicate the set of zero-divisors of R, the set of units of R and the nilradical of a ring R respectively. Also we denote the ring of integers modulo n by Zn. Further Kn, Km,n, Pn, and Cn denote respectively the complete graph on n vertices, complete bipartite graph with a bipartition into vertex sets of cardinality m and n, path on n vertices and cycle with n vertices. Moreover, the neighborhood set of a vertex v in G is NG(u)={vV(G):v is adjacent to uinG}. All the definitions related to algebra are from Dummit and Foote [Citation15], and the definitions related to graph theory are from Chartrand and Zhang [Citation13].

2. Wiener index of graphs associated to rings

In recent years, there are numerous works done on computing or estimating the Wiener index of graphs associated with rings. Let us start with the zero-divisor graph.

In 1988, Beck [Citation11] established the concept of a graph constructed with the zero-divisors of a commutative ring R. After altering Beck’s definition Anderson and Livingston [Citation6] have developed the current concept, as well as the nomenclature for the zero-divisor graph in 1999. For more details on zero-divisor graphs, one may refer to [Citation4]. The modified definition of the zero-divisor graph is as follows.

Definition 2.1.

[Citation6] Let R be a commutative ring with identity and Z(R) be its set of zero-divisors. The zero-divisor graph of R, denoted by Γ(R), is the simple graph with vertex set Z(R)*=Z(R){0}, and two distinct vertices x and y are adjacent if xy = 0.

Some of the initial works on computing Wiener index of zero-divisor graphs are based on algorithms. To begin with, the Wiener index of a zero-divisor graph of Zn, where n=p2 or pq, is determined by Ahmadi and Nezhad in [Citation1]. The relevant results are stated below.

Theorem 2.2.

[Citation1, Theorem 3] If p is a prime number, then W(Γ(Zp2))=(p1)(p2)2.

Theorem 2.3.

[Citation1, Theorem 4] If p and q are two prime numbers, then W(Γ(Zpq))=p2+q2+pq4p4q+5.

The authors of [Citation32] calculated the Wiener index of the zero-divisor graph of Zp3 where p is a prime number.

Theorem 2.4.

[Citation32, Theorem 5.1] If p is a prime number, then W(Γ(Zp3))=(p1)2(2p33p2).

The following theorem is due to Pirzada et al. [Citation29] which gives the Wiener index of Γ(Zpα) for all αN and a prime p.

Theorem 2.5.

[Citation29, Theorem 8] If α is a positive integer and p is a prime, then the Wiener index of Γ(Zpα) is given by W(Γ(Zpα))=i=1α21|Vi|(|Vi|1)+i=α2α1|Vi|(|Vi|1)2+2i=1α21(|Vi|j=i+1αi1|Vj|)+r=1α1(|Vr|j=1rαj>r|Vαj|) where Vi={lipi:pli},1iα1 is the partition of V(Γ(Zpα)).

Recently, Asir and Rabikka [Citation8] determined the Wiener index of the zero-divisor graph of Γ(Zn) for all positive integers n. This will be presented as Theorem 2.6, Theorem 2.7 and Theorem 2.10. Here Theorem 2.6 which deals with the case where n is a prime power simplifies the calculation process of finding W(Γ(Zpα)) compared to the one given Theorem 2.5.

Theorem 2.6.

[Citation8, Theorem 3.1] Let p be prime number and αZ+. Then

  1. W(Γ(Zp))=W(Γ(Z4))=0.

  2. W(Γ(Zpα))=12[2p2(α1)(α1)pα+(α6)pα1+pαα2+2] where α2 and pα4.

Using Theorem 2.6, one can obtain Theorem 2.2 and Theorem 2.4. Next, we move on to remaining cases of positive integers. Actually, Theorem 2.7 and Theorem 2.10 provide a constructive method to calculate the value of Wiener index of zero-divisor graph of Zn for any positive integer n.

Theorem 2.7.

[Citation8, Theorem 3.4] Let n=p1pk where pi’s are distinct primes and 2kZ+. Let dj be a proper divisor of n for j=1,,2k2.

  • For 1jk, let dj=p1pj1·pj+1pk;

  • For k+1j2k2, let dj=p1β1pkβk where βi=0=βi for some distinct i,i{1,,k}. In this case, let Zj={i{1,,k}:βi=0} and let Zj={i1,,ir(j)}. For 1l2r(j)2, define τl(j)=pi1γi1pir(j)γir(j) where γis{0,1} for all 1sr(j) with γit=0 for some 1tr(j).

Then W(Γ(Zn))=12[j=12k2(ϕ(ndj)·(2(nϕ(n))3dj))]+12[j=k+12k2(ϕ(ndj)·l(j)=12r(j)2ϕ(nτl(j)))].

The following Corollary is an immediate consequence of Theorem 2.7.

Corollary 2.8.

Let p1, p2 and p3 be distinct primes. Then

  1. W(Γ(Zp1p2))=p12+p22+p1p24p14p2+5.

  2. W(Γ(Zp1p2p3))=3(p12p2p3+p1p22p3+p1p2p32)15(p1p2p3)+(p12p22+p22p32+p12p32)3[p12(p2+p3)+p22(p1+p3)+p32(p1+p2)]+8(p1p2+p2p3+p1p3)+2(p12+p22+p32)4(p1+p2+p3)+3.

The following remark explains the formula given in Theorem 2.7 with an example. The same example was considered in [Citation8, Remark 3.6], however the details are more elaborated in the following remark.

Remark 2.9.

Consider n=2·3·5·7=210. Then the number of proper divisors of n is 242=14. Here d1=3·5·7,d2=2·5·7,d3=2·3·7 and d4=2·3·5. Let us take d5=2·3,d6=2·5,d7=2·7,d8=3·5,d9=3·7,d10=5·7,d11=2,d12=3,d13=5 and d14=7.

For instance, we illustrate d1, d6, d11 and d14. In general, let dj=2β1·3β2·5β3·7β4 where βi{0,1} for j=1,,14.

Consider d1=3·5·7: Here β1=0. Implies that Z1={1} and so r(1)=1. Consequently τ1(1)=2. Therefore ϕ(nτl(1))=1.

Consider d6=2·5: Here β2=0 and β4=0. Implies that Z6={2,4} and so r(6)=2. Consequently τ1(6)=3 and τ2(6)=7. Therefore l(6)=12ϕ(nτl(6))=24+8=32.

For d11=2, we have Z11={2,3,4} and so r(11)=3. Consequently τ1(11)=3,τ2(11)=5,τ3(11)=7,τ4(11)=3·5,τ5(11)=3·7 and τ6(11)=5·7. Therefore l(11)=16ϕ(nτl(11))=24+12+8+6+4+2=56.

For d14=7, we have Z14={1,2,3} and so r(14)=3. Consequently τ1(14)=2,τ2(14)=3,τ3(14)=5,τ4(14)=2·3,τ5(14)=2·5 and τ6(14)=3·5. Therefore l(14)=16ϕ(nτl(14))=48+24+12+24+12+6=126.

Note that nϕ(n)=21048=160. W(Γ(Z210))=12[j=114(ϕ(ndj)·(2×1603dj))]+12[j=514(ϕ(ndj)·l(j)=12r(j)2ϕ(nτl(j)))]=12[50184+9120]=29652.

The following theorem is the last part of finding the value of Wiener index of Γ(Zn) for any nZ+.

Theorem 2.10.

[Citation8, Theorem 3.8] Let n=p1α1pkαk, where pi is a prime, αiZ+ with at least one αi2 and 2kZ+. Rearrange pi’s such that n=p1pw·pw+1αw+1pkαk where αi2 for all i=w+1,,k. (In case of αi2 for all i=1,,k, take w=0). Let dj=p1β1pkβk be a proper divisor of n for all j=1,,(i=1k(αi+1)2). Arrange dj’s in such a way that

  • for 1jw, let dj=p1pj1·pj+1pw·pw+1αw+1pkαk;

  • for w+1jw+i=1k(αi+12)1, let βiαi/2 for all i=1,,k and, for w+i=1kαi+12jw+i=1kαi1, let βi1 and βi<αi/2 for all i=1,,k and some i{1,,k};

  • for the remaining dj’s, notate j=w+i=1kαi,,i=1k(αi+1)2. In this case, let Zj={i{1,,k}:βi=0} and let Zj={i1,,ir(j)}. For 1lσj, define τl(j)=pi1γi1pir(j)γir(j) where 0γisαis for all 1sr(j). In addition, if βm=αm for all m{1,,k}Zj, then there exists t{1,,r(j)} such that γit<αit.

Then W(Γ(Zn))=12[j=1(i=1k(αi+1))2(ϕ(ndj)·(2(nϕ(n))3dj))]+12[j=w+i=1kαi(i=1k(αi+1))2(ϕ(ndj)·(l(j)=1σjϕ(nτl(j))))]+12(j=w+1(i=1kαi+12)1ϕ(ndj)). where σj={(s=1r(j)(αis+1))2if βm=αm for all m{1,,k}Zj(s=1r(j)(αis+1))1otherwise.

Corollary 2.11.

Let p1 and p2 be distinct primes. Then W(Γ(Zp1p22))=12[6p1p23+2p12p2212p1p22+2p246p23+3p22+3p2+2].

The following remark is an illustration of Theorem 2.10. The same example is listed in [Citation8, Remark 3.10]. But Remark 3.10 [Citation8] has some minor errors which was pointed out by the authors of [Citation33] and that has been revised here. Also some additional calculation part is included in the following remark.

Remark 2.12.

Consider n=5·7·23·32=2520. Here w = 2, i=1k(αi+12)1=3,i=1kαi1=5 and the number of proper divisors is i=1k(αi+1)2=46.

  • d1=7·23·32 and d2=5·23·32.

  • Let d3=5·7·23·3, d4=5·7·22·3, d5=5·7·22·32 and d6=5·7·2·32, d7=5·7·2·3.

  • Let d8=5·7·23, d9=5·7·22, d10=5·7·2, d11=5·7·32, d12=5·7·3, d13=5·2·32, d14=5·2·3, d15=5·22·32, d16=5·22·3, d17=5·23·3, d8=7·2·32, d19=7·2·3, d20=7·22·32, d21=7·22·3, d22=7·23·3, d23=5·7, d24=5·23, d25=5·22, d26=5·2, d27=5·32, d28=5·3, d29=7·23, d30=7·22, d31=7·2, d32=7·32, d33=7·3, d34=23·32, d35=23·3, d36=22·32, d37=22·3, d38=2·32, d39=2·3, d40=5, d41=7, d42=23, d43=22, d44=2, d45=32 and d46=3.

In general, take dj=5β1·7β2·2β3·3β4 where βi{1,,αi} for j=1,,46. For instance, we elaborate the terms in the formula of W(Γ(Zn)) for d33 and d41.

For d12=5·7·3 since β3=0 we have Z12={3}. That is r(12)=1,i1=3. Here β4<α4, and so σj=3. Consequently τ1(12)=32, τ2(12)=2, τ3(12)=22. Therefore l(12)=13ϕ(nτl(12))=96+288+144=528.

For d23=5·7 since β3=β4=0 we have Z24={3,4}. That is r(23)=2,i1=3 and i2=4. Here βi=αi for i = 1, 2, and so σj=(s=12(αis+1))2=10. Consequently τ1(23)=3, τ2(23)=32, τ3(23)=2, τ4(23)=22, τ5(23)=23, τ6(23)=2·3, τ7(23)=2·32, τ8(23)=22·3, τ9(23)=22·32, τ10(23)=23·3. Therefore l(23)=110ϕ(nτl(23))=192+96+288+144+144+96+48+48+24+48=1128.

For d33=7·3; we have β1=β3=0, which implies that Z33={1,3}. That is r(33)=2,i1=1 and i2=3. Since β4<α4, we have σj=(s=12(αis+1))1=7. Consequently τ1(33)=2, τ2(33)=22, τ3(33)=23, τ4(33)=5, τ5(33)=5·2, τ6(33)=5·22 and τ7(33)=5·23. Therefore l(33)=17ϕ(nτl(33))=288+144+144+72+36+36+144=864.

For d41=7; we have Z41={1,3,4}. Since β2=α2,σj=(s=13(αis+1))2=22. Consequently, τ1(33)=2, τ2(33)=22, τ3(33)=23, τ4(33)=3, τ5(33)=32, τ6(33)=5, τ7(33)=2·3, τ8(33)=22·3, τ9(33)=23·3, τ10(33)=2·32, τ11(33)=22·32, τ12(33)=23·32, τ13(33)=5·2, τ14(33)=5·22, τ15(33)=5·23, τ16(33)=5·3, τ17(33)=5·32, τ18(33)=5·2·3, τ19(33)=5·22·3, τ20(33)=5·23·3, τ21(33)=5·2·32 and τ22(33)=5·22·32. Therefore l(41)=122ϕ(nτl(11))=288+144+144+192+96+144+96+48+48+48+24+24+72+36+36+48+24+24+12+12+12+6=1578.

Note that nϕ(n)=2520576=1944. So W(Γ(Z2520))=12[j=146(ϕ(ndj)·(2×19443dj))]+12[j=846(ϕ(ndj)·(l(j)=1σjϕ(nτl(j))))]+12(j=35ϕ(ndj))=12[7502511+1401984+5]=4452250.

Recently, using Wiener matrix and composition of graphs Selvakumar et al. [Citation33] derived a formula for the Wiener index of the zero-divisor graph of a finite commutative ring R. More specifically, they explicitly calculated the Wiener index of Γ(R) when R is a reduced ring, ring of integers modulo n, and more generally the product of ring of integers modulo n. Before moving into those results, let us introduce the required definitions and notations.

Definition 2.13.

Let H be a graph with vertex set V={1,,k} and let G1,,Gk be a collection of graphs with the respective vertex sets Vi={vi1,,vini} for (1ik). Then their generalized composition G=H[G1,,Gk] has vertex set V1Vk and two vertices vip and vjp of H[G1,,Gk] are adjacent if one of the following condition is satisfied:

  • i=j, and vip and vjq are adjacent vertices in Gi.

  • ij and i and j are adjacent in H.

The graph H is said to be the base graph of G and the graphs Gi’s are called the factors of G.

Some more notions are defined in the following assumption.

Assumption 2.14.

Let R be an arbitrary finite commutative ring with unity. First, let us define an equivalence relation ∼ on Z(R)* as follows. For x,yZ(R)*, define xy if and only if Ann(x)=Ann(y) where Ann(x)={aR:ax=0}. Let C1,,Ck be the equivalence classes of this relation with respective representatives c1,,ck. Then Z(R)*=i=1kCi. Let us call these classes the equiv-annihilator classes of Γ(R).

Let G be a graph such that G=H[G1,,Gk] where H is a connected graph on k vertices and the factor graphs Gis are either complete or empty (graph with vertices but no edges). Let V(Gi)={vi1,,vini} be the vertex set of the graph Gi, then V(G)=i=1kV(Gi). Let us define the Wiener matrix of the graph G as follows;

Definition 2.15.

The Wiener matrix W(G) of the graph G is defined as follows. The matrix W(G) is index by the vertex set of H. For two vertices i,jH, define W(G)i,j={(|Gi|2) if i=j and Gi is complete,2(|Gi|2) if i=j and Gi is empty,|Gi|·|Gj|dH(i,j) if ij where |Gi| denotes the number of vertices in the factor graph Gi.

For the rest of the section, we will consider the notations from Definition 2.13, Assumption 2.14 and Definition 2.15 wherever required.

The following lemma proves that the graph Γ(R) is a generalized composition of certain complete graphs and empty graphs. Using this observation the formula for the Wiener index of Γ(R) is deduced.

Lemma 2.16.

[Citation33, Proposition 1] Let Ci be as in Assumption 2.14. Let Gi be the subgraph induced by the set Ci in Γ(R). Then Γ(R)=H[G1,,Gk].

In [Citation33], the authors have provided a formula for the Wiener index of the zero-divisor graph of an arbitrary finite commutative ring with unity. These approaches are different from [Citation8], specifically they visualize the zero-divisor graph Γ(R) as a generalized composition of suitable choices of graphs. The main formula for the Wiener index of zero-divisor graph of finite commutative ring is given in Theorem 2.19. Before moving into the main result, we need the two lemmas. The first lemma explains the distance between any two vertices of a graph G as defined in the Assumption 2.14.

Lemma 2.17.

[Citation33, Lemma 3] Let vip and vjq(1pni and 1qnj) be two arbitrary vertices of G. Then dG(vip,vjq)={1 if i=j and Gi is complete 2 if i=j and Gi is empty dH(i,j) if ij where dG(vip,vjq) denotes the distance between the vertices vip and vjq in the graph G.

The second lemma deals with the Wiener index of the graph G which was given in Assumption 2.14.

Lemma 2.18.

[Citation33, Lemma 4] Let G be the graph defined in Assumption 2.14. Then the Wiener index of G is given by W(G)=1ik,Gi is complete (ni2)+1ik,Gi is empty 2(ni2)+1i<jkninjdH(i,j). where |Gi|=ni. In particular, the Wiener index of G is equal to the total trace of the Wiener matrix W(G).

Now we deduce a formula for the Wiener index of the zero-divisor graph of a commutative ring R. Note that, by Lemma 2.16, we have Γ(R)=H[Γ(C1),,Γ(Ck)] with each Γ(Ci) either complete or empty. Hence, we can use Lemma 2.18 to calculate the Wiener index of Γ(R).

Theorem 2.19.

[Citation33, Theorem 1] Let R be an arbitrary finite commutative ring with unity. Then the Wiener index of the graph Γ(R) is equal to W(Γ(R))=1ik,ci2=0(|Ci|2)+1ik,ci202(|Ci|2)+1i<jk|Ci|·|Cj|dH(ci,cj).

In particular, the Wiener index of Γ(G) is equal to the total trace of the Wiener matrix W(Γ(G)).

Further, note that the value of dH(ci,cj) can be deduced from Lemma 2.17.

The authors of [Citation33] have also calculated the Wiener index of the zero-divisor graph Γ(R) when R is a finite commutative reduced ring with unity. Before moving into the corresponding result, we need the following notations for the subsequent results.

Notation 2.20.

It is well-known that every finite commutative reduced ring with unity can be written as the product of finite fields. Let R=Fq1××Fqk where qi=piki and Fq is the finite field with q elements. We have Z(Fq)={0}. Let Pk={A[k]:A and A[k]} where [k]:={1,,k}. For APk, we define the characteristic vector of A to be the element 1A=(a1,,ak)R satisfying ai = 1 if iA and ai = 0 otherwise. Also, for APk, define the sets CA={(a1,,ak)R:ai is nonzeroifandonlyifiA}.

Note that the vertex set of H is V(H)={1A:APk} and the vertices 1A and 1B are adjacent in H if and only if 1A·1B=0 if and only if AB=.

Lemma 2.21.

[Citation33, Lemma 6] Let 1A and 1B be two distinct vertices of H then dH(1A,1B)={1ifAB=,2ifAB and AB[k],3ifAB and AB=[k].

Notation 2.22.

Define the sets D1={{A,B}:A,BPk,AB and AB=},D2={{A,B}:A,BPk,AB,AB and AB[k]} and D3={{A,B}:A,BPk,AB,AB and AB=[k]}.

The cardinality of the sets D1,D2, and D3 can be calculated using the following expression.

Proposition 2.23.

[Citation33, Proposition 2] The sets D1, D2 and D3 have the following cardinalities.

  1. |D1|=i=2k(ki)(2i11)

  2. |D3|=i=1k1(ki)(2i11)

  3. |D2|=12((k2)×(k2)(k2))|D1||D3|

The following result gives a expression for the Wiener index of zero-divisor graph of finite commutative reduced ring with unity. All the undefined notations in the following statement are from Notation 2.20 and Notation 2.22.

Theorem 2.24.

[Citation33, Theorem 2] Let R be a finite commutative reduced ring with unity. Then the Wiener index of Γ(R) is given by W(Γ(R))=APk2(iA(qi1)2)+{A,B}D1(iA(qi1))(iB(qi1))+{A,B}D22(iA(qi1))(iB(qi1))+{A,B}D33(iA(qi1))(iB(qi1)).

Using Theorem 2.24, the authors of [Citation33] have deduced Corollary 2.8 and Remark 2.9.

Example 2.25.

[Citation33, Example 5] Assume that R=Z2××Z2ktimes. Then for each APk, we have |CA|=1. Therefore, the Wiener index of Γ(R) can be written in the following form W(Γ(R))=|D1|+2|D2|+3|D3|. The values of |Di| for i = 1, 2, 3 can be calculated using Proposition 2.23.

Using Theorem 2.19, the authors of [Citation33] have provided an expression for the Wiener index of the zero-divisor graph of product of ring of integers modulo n; Interested readers can refer [Citation33, Theorem 4].

Moreover, Koam et al. [Citation3] have determined several edge-based eccentric topological indices of a zero-divisor graph of some algebraic structures; Interested readers can refer [Citation3] for corresponding results.

At the end of this section, we have mentioned some basic results regarding the Wiener index for line graph of zero-divisor graph of Zn.

Theorem 2.26.

[Citation34, Theorem 3.5] If q is an odd prime number, then W(L(Γ(Z2q))) is (q1)(q2)2.

Theorem 2.27.

[Citation34, Theorem 3.6] If q > 3 is any prime number, then W(L(Γ(Z3q))) is (q1)(3q5).

Theorem 2.28.

[Citation34, Theorem 3.7] If p, q are distinct odd prime numbers, then W(L(Γ(Zpq))) is 12(p1)(q1)(2pq3p3q+4).

Theorem 2.29.

[Citation34, Theorem 3.8] If p is any prime number and p5, then W(L(Γ(Zp2))) is 14(p1)(p2)2(p3).

Let us close this section, by mentioning an open problem in this subject area.

Question 2.30. Find the Wiener index of L(Γ(Zn))) for np,p2 or pq where p and q are primes.

3. Wiener index of unit graphs and total graphs

In 1990, Grimaldi [Citation16] discovered the unit graph for Zn. For an arbitrary ring R, Ashrafi et al. [Citation7] generalized the unit graph G(Zn) to G(R) in 2010. There are numerous other articles on this specific topic (see [Citation10,Citation23–26]). In [Citation22], one can find a survey of the study on unit graphs.

Definition 3.1.

Let R be a commutative ring with nonzero identity and U(R) be the set of all units in R. The unit graph of R, denoted by G(R), has vertex set as the set of all elements of R, for distinct vertices x and y are adjacent if and only if x+yU(R).

In 2015, Pranjali and Acharya [Citation30] proposed an algorithm to find the Wiener index of G(Zn) and using the algorithm they found the value of W(G(Zn)) for n=2,3,5,15,48. Recently, Asir et al. [Citation9] have determined the Wiener index for unit graph of any finite commutative ring. Note that Theorem 3.2 and Theorem 3.3 gives the value of the Wiener index for unit graph of a finite commutative ring R in terms of cardinality of R and cardinality of U(R), the set of units of R.

Theorem 3.2.

[Citation9, Theorem 2.5] Let R be a finite commutative ring. Then the following statements hold:

  1. If R is isomorphic to a field with Char(R) = 2, then W(G(R))=|R|2|R|2.

  2. If R is isomorphic to one of the following rings

    1. R is a field with Char(R)2;

    2. R is not a field and R cannot have Z2 as a quotient;

    3. R is a local ring with maximal ideal m such that |R/m|=2 and RZ2,

then W(G(R))={|R|2(|U(R)|2+1)|R|, if 2U(R)|R|2(|U(R)|2+1)|R|+|U(R)|2, if 2U(R)

  1. If R is isomorphic to a non-local ring with Z2 as a quotient and cannot have Z2×Z2 as a quotient, then W(G(R))=54|R|2(|U(R)|+1)|R|.

Normally, Wiener index is meaningless for a disconnected graph. However, the authors of [Citation21] have defined the Wiener index of a disconnected graph as the sum of all Wiener index of connected components of G. That is W(G)=iW(Gi) where Gi is the connected components of G. Note that a component or block is a maximal connected subgraph of G.

Theorem 3.3.

[Citation9, Theorem 2.6] If R has Z2×Z2 as a quotient where RR1××Rp×Rp+1××Rn where each Ri is local with maximal ideal mi for 1in and Rj/mjZ2 for j=1,,p with p2, then W(G(R))={32p+1|R|2|R| if n=p52p+1|R|2(|U(R)|+1)|R|otherwise.

By applying the values of |R| and |U(R)| in Theorem 3.2, one will get the value of the Wiener index of any finite commutative ring. For instance, an example for this is given below. In what follows, the Euler phi-function for a positive integer n is denoted by ϕ(n).

Example 3.4.

[Citation9, Example 2.7]

  1. Let R=Zn.

    1. If n=2m for some mZ+, then W(G(R))=22m22m22m.

    2. If n=p1α1p2α2pnαk, where each pi’s is an odd prime and αiZ+ for i=1,,n, then W(G(R))=n2n12(n1)ϕ(n).

    3. If n=2α0p1α1p2α2pnαk, where each pi’s is an odd prime and αiZ+ for i=0,1,,n, then W(G(R))=5n24n(ϕ(n)+1).

  2. Let R=Zn[x]x2.

  3. If n=2m for some mZ+, then W(G(R))=24m24m222m.

  4. If n=p1α1p2α2pnαn where each pi’s is an odd prime and αiZ+ for i=1,,n, then W(G(R))=n4n2n2(n21)ϕ(n).

  5. If n=2α0p1α1p2α2pnαn where each pi’s is an odd prime and αiZ+ for i=0,1,,n, then W(G(R))=54n4(nϕ(n)+1)n2.

  6. Let R=Zn[x]x2,xy,y2.

    1. If n=2m for some mZ+, then W(G(R))=26m26m223m.

    2. If n=p1α1p2α2pnαn, where each pi’s is an odd prime and αiZ+ for i=1,,n, then W(G(R))=n9n3n2(n31)ϕ(n).

    3. If n=2α0p1α1p2α2pnαn, where each pi’s is an odd prime and αiZ+ for i=0,1,,n, then W(G(R))=54n6(n2ϕ(n)+1)n3.

Next, let us see the result on hyper-Wiener index of the unit graph of a commutative ring. The following result determines the hyper-Wiener index for the graph G(R).

Theorem 3.5.

[Citation9, Theorem 2.8] Let R be a finite commutative ring. Then the following statements hold:

  1. If R is isomorphic to a field with Char(R) = 2, then HW(G(R))=|R|2|R|.

  2. If R is isomorphic to one of the following rings

    1. R is a field with Char(R)2;

    2. R is not a field and R cannot have Z2 as a quotient;

    3. R is a local ring with maximal ideal m such that |R/m|=2 and RZ2,

then HW(G(R))={3|R|22|R|·|U(R)|3|R|, if 2U(R)3|R|22|R|·|U(R)|3|R|+2|U(R)|, if 2U(R)
  1. If R is isomorphic to a non-local ring with Z2 as a quotient and cannot have Z2×Z2 as a quotient, then HW(G(R))=92|R|25|R|·|U(R)|3|R|.

In variation to the concept of zero-divisor graph, Anderson and Badawi [Citation5] introduced the total graph of a commutative ring. There are numerous research articles which have been published on the total graph of commutative rings (see [Citation2,Citation5,Citation27,Citation36,Citation37]).

Definition 3.6.

Let R be a commutative ring and Z(R) be the set of all zero-divisors of R. The total graph of R is a simple graph with all the elements of a ring as the vertices in which distinct x,yR are adjacent if and only if x+yZ(R).

Let us close this section by mentioning some works on the Wiener index of total graph of a commutative ring. The first work in this direction provided the Wiener index of the total graph of Zn when n=p2 or pq for some primes p and q by Sheela and Om Prakash [Citation35]. Here is the result on the Wiener index of total graphs.

Theorem 3.7.

[Citation35, Theorem 4.1] If q is an odd prime, then W(TΓ(Z2q)) is q2+2q(q1).

Theorem 3.8.

[Citation35, Theorem 4.2] If p, q are distinct odd primes, then W(TΓ(Zpq)) is 12(2p2q2p2qpq2pq+p+q1).

Theorem 3.9.

[Citation35, Theorem 4.3] If q is an odd prime, then W(TΓ(Z4q)) is 2q(6q3)

Theorem 3.10.

[Citation35, Theorem 4.4] If p, q are distinct odd primes, then W(TΓ(Zp2q))=2p4q2p4qp3q2+p3q2p2q+p2+pqp.

In 2014, Nikmehr et al. [Citation28] found the Wiener index of total graph of Zn for all the positive integer n. For n=pα, the total graph TΓ(Zn) is disconnected. But, we can find the Wiener index of a disconnected graph using connected components of TΓ(Zn). The relevant result is stated below.

Theorem 3.11.

Let p be a prime and αZ+. Then the Wiener index of TΓ(Zpα) is as follows: W(TΓ(Zpα))={2α1(2α11) if p=2,3p2α12p2α2+pα12pα2otherwise.

Proof.

By [Citation36, Theorem 3.2], we get that TΓ(Zpα)={K2(α1)K2(α1)if p=2Kp(α1)Kp(α1),p(α1)Kp(α1),p(α1)Kp(α1),p(α1)p12 times       otherwise.

We know that the Wiener index of complete graph Kl is l(l1)2 and the Wiener index of complete bipartite graph Kl,l is 3l22l. Therefore W(TΓ(Z2α))=2α1(2α11) and W(TΓ(Zpα))=p(α1)(p(α1)1)2+(p1)2(3p2(α1)2p(α1))=12(3p2α12p2α2+pα12pα).

Theorem 3.12.

[Citation28, Theorem 3.1] Let n be an integer and not a prime power. Then the Wiener index of TΓ(Zn) is as follows: W(TΓ(Zn))={n(2nm1)2 if n is even,(n1)(2nm)2 if n is odd

where m=|Z(Zn)|.

The next result gives the value of the hyper-Wiener index of total graph of Zn. First let us calculate the prime power case. Using a similar proof technique in Theorem 3.11, one can prove the following.

Theorem 3.13.

Let p be a prime and αZ+. Then the hyper-Wiener index of TΓ(Zpα), is as follows: HW(TΓ(Zpα))={2α(2α11) if p=2,4p2α13p2α2+2pα13pαotherwise.

Theorem 3.14.

[Citation28, Theorem 3.2] Let n be an integer and not a prime power. Then the hyper-Wiener index of Γ(Zn) is as follows: HW(TΓ(Zn))={n(3n2m1)2 if n is even,(n1)(3n2m)2 if n is odd where m=|Z(Zn)|.

In the following example, we have listed the values for W(TΓ(Zn)) and HW(TΓ(Zn)) when n=6,10,15,20.

Example 3.15.

[Citation28, Example 3.10] The values of W(TΓ(Zn)) and HW(TΓ(Zn)) for n=6,10,15,20 are as follows:

Let us close the section, by mentioning some open problems in the subject area.

Question 3.16. Let n be an integer and not a prime power. Then find the value of Wiener index of the total graph of Zn?

Question 3.17. Let R be a finite commutative ring. Find an expression for the Wiener index of total graph of R?

4. Wiener index of prime graphs

Another graph associated with ring is called a prime graph, which was introduced by Satyanarayana et al. [Citation12] in 2010.

Definition 4.1.

Prime graph of a ring is defined as a graph whose vertices are all elements of the ring and any two distinct vertices x,yR are adjacent if and only if xRy=0 or yRx=0. This graph is denoted by PG(R).

It is proved that if R is a semi-prime ring, then R is a prime ring if and only if the prime graph PG(R) is a tree. Recall that an ideal of a ring is said to be semi-prime if and only if it is an intersection of prime ideals of the ring and a semi-prime ring is one in which the zero ideal is semi-prime. For some specific cases of n, the authors in [Citation19] have calculated the Wiener index of PG(Zn). The corresponding results are listed below.

Theorem 4.2.

[Citation19, Theorem 3.2] If p is a prime, then W(PG(Zp))=(p1)2.

Theorem 4.3.

[Citation19, Theorem 3.3] If p is a prime, then W(PG(Zp2))=p(p1)2·[2p22p+1].

Theorem 4.4.

[Citation19, Theorem 3.4] If p is a prime, then W(PG(Zp3))=p(p1)2·[2p4+2p32p3].

The authors in [Citation19] also evaluated the Wiener index of line graph of the prime graph PG(Zn). Note that the line graph L(PG(Zn)) of the graph PG(Zn) is defined as the graph whose set of vertices constitutes of the edges of PG(Zn), where two vertices are adjacent if the corresponding edges have a common vertex in PG(Zn).

Theorem 4.5.

[Citation19, Theorem 4.19] Let n = 4 or an odd prime, then W(L(PG(Zn)))=n(n1)2.

Let us close the section, by mentioning some open problems in the subject area.

Question 4.6. Find the Wiener index of PG(Zn) for npk, where p is prime and k{1,2,3}.

Question 4.7. Find the Wiener index of L(PG(Zn)) for a non-prime integer n.

5. Conclusion

Even though the study of Wiener index of graphs from rings started in the year 2010, a decade of research in this area has brought out only some specific cases of graphs over Zn. The three very recent works due to Asir [Citation8], Selvakumar et al. [Citation33] and Asir et al. [Citation8] provided formulas for calculating the Wiener index of zero-divisor graphs of Zn, zero-divisor graphs of any finite commutative ring with unity and unit graphs of any finite commutative ring with unity respectively. Now, these results opens the platform for finding the Wiener index of other well-studied classes of graphs from rings which includes annihilating-ideal graphs, annihilator graphs, comaximal graphs, Cayley graphs, Jacobson graphs, generalized total graphs, Cayley sum graphs and trace graphs of matrices.

The Wiener index is mostly used to determine the structure-property relationships. In particular, the Wiener index has a variety of applications in pharmaceutical science and in the structure of nanotubes. Further, the graphs constructed from ring structures are highly symmetric and so they have some remarkable properties in connecting chemical graph theory and networks in parallel computing. Thus, it is expected that the investigation process of finding Wiener index of graphs from rings may have some interesting applications in molecular graphs, theoretical computer science and networking.

Disclosure statement

No potential conflict of interest was reported by the authors.

References

  • Ahmadi, M. R, Nezhad, R. J. (2011). Energy and Wiener index of zero-divisor graphs. Iran. J. Math. Chem. 2(1): 45–51.
  • Afkhami, M., Barati, Z, Khashyarmanesh, K. (2014). When the unit, unitary and total graphs are ring graphs and outer planar. Rocky Mountain J. Math. 44(3): 705–716.
  • Koam, A. N. A., Ahmad, A, Haider, A. (2019). On eccentric topological indices based on edges of zero-divisor graphs. Symmetry 11(7): 907.
  • Anderson, D. F., Asir, T., Tamizh Chelvam, T, Badawi, A. (2021). Graphs from Rings. New York: Springer International Publishing.
  • Anderson, D. F, Badawi, A. (2008). The total graph of commutative ring. J. Algebra 320(7): 2706–2719.
  • Anderson, D. F, Livingston, P. S. (1999). The zero-divisor graph of a commutative ring. J. Algebra 217(2): 434–447.
  • Ashrafi, N., Maimani, H. R., Pournaki, M. R, Yassemi, S. (2010). Unit graphs associated with rings. Comm. Algebra 38(8): 2851–2871.
  • Asir, T, Rabikka, V. (2022). The Wiener index of the zero-divisor graph of Zn. Discrete Appl. Math. 319: 461–471.
  • Asir, T., Rabikka, V, Su, H. (2022). On Wiener index of unit graph associated with a commutative ring. Algebra Colloq. 29(02): 221–230.
  • Asir, T, Tamizh Chelvam, T. (2014). On the genus of generalized unit and unitary Cayley graphs of a commutative ring. Acta Math. Hung. 142(2): 444–458.
  • Beck, I. (1988). Coloring of commutative rings. J. Algebra 116(1): 208–226.
  • Bhavanari, S., Kuncham, S. P, Dasari, N. (2010). Prime graph of a ring. J. Comb. Inf. Syst. Sci 35(1–2): 27–42.
  • Chartrand, G. (2000). Lesniak, Graphs and Digraphs. New York: Chapman & Hall/CRC.
  • Dobrynin, A., Entringer, R, Gutman, I. (2001). Wiener index of trees: theory and applications. Acta Appl. Math. 66(3): 211–249.
  • Dummit, D. S, Foote, R. M. (2003). Abstract Algebra. Hoboken, New Jersey: Wiley.
  • Grimaldi, R. P. (1990). Graphs from rings. Proceedings of the 20th Southeastern Conference on Combinatorics. Graph Theory and Computing (Boca Raton, FL), Congr. Numer 71: 95–103.
  • Gutman, I, Polansky, O. E. (1986). Mathematical Concepts in Organic Chemistry, Springer-Verlag: New York, NY, USA.
  • Hosoya, H. (1971). Topological index. a newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. BCSJ. 44(9): 2332–2339.
  • Joshi, S. S, Pawar, K. F. (2018). Energy, Wiener index and Line graph of prime graph of a ring. Int. J. Math. Combin. 3: 74–80.
  • Klein, D. J., Lukovits, I, Gutman, I. (1995). On the definition of the hyper-Wiener index for cycle-containing structures. J. Chem. Inf. Comput. Sci. 35(1): 50–52.
  • Knor, M., Lužar, B., Škrekovski, R, Gutman, I. (2014). On Wiener index of common neighborhood graphs. Commun. Math. Comput. Chem. 72: 321–332.
  • Maimani, H. R., Pournaki, M. R., Tehranian, A, Yassemi, S. (2011). Graphs attached to rings revisited. Arab. J. Sci. Eng. 36(6): 997–1011.
  • Maimani, H. R., Pournaki, M. R, Yassemi, S. (2011). Necessary and sufficient conditions for unit graphs to be Hamiltonian. Pacific J. Math. 249(2): 419–429.
  • Maimani, H. R., Pournaki, M. R, Yassemi, S. (2010). Weakly perfect graphs arising from rings. Glasgow Math. J. 52(3): 417–425.
  • Maimani, H. R., Pournaki, M. R, Yassemi, S. (2010). Rings which are generated by their units: a graph theoretical approach. Elem. Math. 65(1): 17–25.
  • Maimani, H. R., Pournaki, M. R, Yassemi, S. (2010). A class of weakly perfect graphs. Czech. Math. J. 60(4): 1037–1041.
  • Maimani, H. R., Wickham, C, Yassemi, S. (2012). Rings whose total graphs have genus at most one. Rocky Mountain J. Math. 42(5): 1551–1560.
  • Nikmehr, M. J., Heidarzadeh, L, Soleimani, N. (2014). Calculating different topological indices of total graph of Zn. Stud. Sci. Math. Hung. 51(1): 133–140.
  • Pirzada, S., Aijaz, M, Imran Bhat, M. (2020). On zero-divisor graphs of the rings Zn. Afr. Math. 31: 727–737.
  • Pranjali, M. Acharya, (2015). Energy and Wiener index of unit graph. Appl. Math. Inf. Sci. 9(3): 1339–1343.
  • Randic, M. (1993). Novel molecular descriptor for structure-property studies. Chem. Phys. Lett. 211(4–5): 478–483.
  • Reddy, B. S., Jain, R. S, Laxmikanth, N. (2017). Eigenvalues and Wiener index of the zero-divisor graph Γ(Zn). arXiv:1707.05083 [Math.RA].
  • Selvakumar, K., Gangaeswari, P, Arunkumar, G. (2022). The Wiener index of the Zero-divisor graph of a finite commutative ring with unity. Discrete Appl. Math. 311: 72–84.
  • Sheela, S, Prakash, O. (2018). Adjacency matrix and energy of the line graph of Γ(Zn). arXiv:1806.08944v1 [Math.CO].
  • Sheela, S, Prakash, O. (2017). Energy and Wiener index of total graph over ring Zn. Electron. Notes Discrete Math. 63: 485–495.
  • Tamizh Chelvam, T, Asir, T. (2013). On the genus of the total graph of a commutative ring. Comm. Algebra 41(1): 142–153.
  • Tamizh Chelvam, T, Asir, T. (2013). On the total graph and its complement of a commutative ring. Comm. Algebra 41(10): 3820–3835.
  • Wiener, H. (1947). Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69(1): 17–20.