![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
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 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,
where
is the distance of a vertex u of a graph,
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
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 We denote
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
Further Kn,
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
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 is the simple graph with vertex set
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 where
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
Theorem 2.3.
[Citation1, Theorem 4] If p and q are two prime numbers, then
The authors of [Citation32] calculated the Wiener index of the zero-divisor graph of where p is a prime number.
Theorem 2.4.
[Citation32, Theorem 5.1] If p is a prime number, then
The following theorem is due to Pirzada et al. [Citation29] which gives the Wiener index of for all
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 is given by
where
is the partition of
Recently, Asir and Rabikka [Citation8] determined the Wiener index of the zero-divisor graph of 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
compared to the one given Theorem 2.5.
Theorem 2.6.
[Citation8, Theorem 3.1] Let p be prime number and . Then
where
and
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 for any positive integer n.
Theorem 2.7.
[Citation8, Theorem 3.4] Let where pi’s are distinct primes and
. Let dj be a proper divisor of n for
For
, let
;
For
, let
where
for some distinct
. In this case, let
and let
. For
, define
where
for all
with
for some
Then
The following Corollary is an immediate consequence of Theorem 2.7.
Corollary 2.8.
Let p1, p2 and p3 be distinct primes. Then
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 Then the number of proper divisors of n is
Here
and
Let us take
and
For instance, we illustrate d1, d6, d11 and d14. In general, let where
for
Consider Here
Implies that
and so
Consequently
Therefore
Consider Here
and
Implies that
and so
Consequently
and
Therefore
For we have
and so
Consequently
and
Therefore
For we have
and so
Consequently
and
Therefore
Note that
The following theorem is the last part of finding the value of Wiener index of for any
Theorem 2.10.
[Citation8, Theorem 3.8] Let , where pi is a prime,
with at least one
and
. Rearrange pi’s such that
where
for all
In case of
for all
, take
. Let
be a proper divisor of n for all
. Arrange dj’s in such a way that
for
let
;
for
let
for all
and, for
let
and
for all
and some
;
for the remaining dj’s, notate
In this case, let
and let
. For
, define
where
for all
. In addition, if
for all
, then there exists
such that
Then
where
Corollary 2.11.
Let p1 and p2 be distinct primes. Then
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 Here w = 2,
and the number of proper divisors is
and
Let
and
Let
and
In general, take where
for
For instance, we elaborate the terms in the formula of
for d33 and d41.
For since
we have
That is
Here
and so
Consequently
Therefore
For since
we have
That is
and
Here
for i = 1, 2, and so
Consequently
Therefore
For we have
which implies that
That is
and
Since
we have
Consequently
and
Therefore
For we have
Since
Consequently,
and
Therefore
Note that So
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 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 and let
be a collection of graphs with the respective vertex sets
for
Then their generalized composition
has vertex set
and two vertices
and
of
are adjacent if one of the following condition is satisfied:
and
and
are adjacent vertices in Gi.
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 as follows. For
define
if and only if
where
Let
be the equivalence classes of this relation with respective representatives
Then
Let us call these classes the equiv-annihilator classes of
Let G be a graph such that where H is a connected graph on k vertices and the factor graphs
s are either complete or empty (graph with vertices but no edges). Let
be the vertex set of the graph Gi, then
Let us define the Wiener matrix of the graph G as follows;
Definition 2.15.
The Wiener matrix of the graph G is defined as follows. The matrix
is index by the vertex set of H. For two vertices
, define
where
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 is a generalized composition of certain complete graphs and empty graphs. Using this observation the formula for the Wiener index of
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 . Then
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 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 and
be two arbitrary vertices of G. Then
where
denotes the distance between the vertices
and
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
where
. In particular, the Wiener index of G is equal to the total trace of the Wiener matrix
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 with each
either complete or empty. Hence, we can use Lemma 2.18 to calculate the Wiener index of
Theorem 2.19.
[Citation33, Theorem 1] Let R be an arbitrary finite commutative ring with unity. Then the Wiener index of the graph is equal to
In particular, the Wiener index of is equal to the total trace of the Wiener matrix
Further, note that the value of can be deduced from Lemma 2.17.
The authors of [Citation33] have also calculated the Wiener index of the zero-divisor graph 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 where
and
is the finite field with q elements. We have
Let
and
where
For
we define the characteristic vector of A to be the element
satisfying ai = 1 if
and ai = 0 otherwise. Also, for
define the sets
Note that the vertex set of H is and the vertices
and
are adjacent in H if and only if
if and only if
Lemma 2.21.
[Citation33, Lemma 6] Let and
be two distinct vertices of H then
Notation 2.22.
Define the sets
The cardinality of the sets 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.
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 is given by
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 Then for each
we have
Therefore, the Wiener index of
can be written in the following form
The values of
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
Theorem 2.26.
[Citation34, Theorem 3.5] If q is an odd prime number, then is
Theorem 2.27.
[Citation34, Theorem 3.6] If q > 3 is any prime number, then is
Theorem 2.28.
[Citation34, Theorem 3.7] If p, q are distinct odd prime numbers, then is
Theorem 2.29.
[Citation34, Theorem 3.8] If p is any prime number and , then
is
Let us close this section, by mentioning an open problem in this subject area.
Question 2.30. Find the Wiener index of for
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 For an arbitrary ring R, Ashrafi et al. [Citation7] generalized the unit graph
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
In 2015, Pranjali and Acharya [Citation30] proposed an algorithm to find the Wiener index of and using the algorithm they found the value of
for
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:
If R is isomorphic to a field with Char(R) = 2, then
If R is isomorphic to one of the following rings
R is a field with
;
R is not a field and R cannot have
as a quotient;
R is a local ring with maximal ideal
such that
and
then
If R is isomorphic to a non-local ring with
as a quotient and cannot have
as a quotient, then
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 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 as a quotient where
where each Ri is local with maximal ideal
for
and
for
with
, then
By applying the values of and
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
Example 3.4.
[Citation9, Example 2.7]
Let
If
for some
, then
If
, where each pi’s is an odd prime and
for
, then
If
, where each pi’s is an odd prime and
for
, then
Let
If
for some
, then
If
where each pi’s is an odd prime and
for
, then
If
where each pi’s is an odd prime and
for
, then
Let
If
for some
, then
If
, where each pi’s is an odd prime and
for
, then
If
, where each pi’s is an odd prime and
for
, then
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:
If R is isomorphic to a field with Char(R) = 2, then
If R is isomorphic to one of the following rings
R is a field with
;
R is not a field and R cannot have
as a quotient;
R is a local ring with maximal ideal
such that
and
If R is isomorphic to a non-local ring with
as a quotient and cannot have
as a quotient, then
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 are adjacent if and only if
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 when
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 is
Theorem 3.8.
[Citation35, Theorem 4.2] If p, q are distinct odd primes, then is
Theorem 3.9.
[Citation35, Theorem 4.3] If q is an odd prime, then is
Theorem 3.10.
[Citation35, Theorem 4.4] If p, q are distinct odd primes, then
In 2014, Nikmehr et al. [Citation28] found the Wiener index of total graph of for all the positive integer n. For
the total graph
is disconnected. But, we can find the Wiener index of a disconnected graph using connected components of
The relevant result is stated below.
Theorem 3.11.
Let p be a prime and . Then the Wiener index of
is as follows:
Proof.
By [Citation36, Theorem 3.2], we get that
We know that the Wiener index of complete graph is
and the Wiener index of complete bipartite graph
is
Therefore
and
□
Theorem 3.12.
[Citation28, Theorem 3.1] Let n be an integer and not a prime power. Then the Wiener index of is as follows:
where
The next result gives the value of the hyper-Wiener index of total graph of 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 . Then the hyper-Wiener index of
, is as follows:
Theorem 3.14.
[Citation28, Theorem 3.2] Let n be an integer and not a prime power. Then the hyper-Wiener index of is as follows:
where
In the following example, we have listed the values for and
when
Example 3.15.
[Citation28, Example 3.10] The values of and
for
are as follows:
Table
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 ?
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 are adjacent if and only if
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 The corresponding results are listed below.
Theorem 4.2.
[Citation19, Theorem 3.2] If p is a prime, then
Theorem 4.3.
[Citation19, Theorem 3.3] If p is a prime, then
Theorem 4.4.
[Citation19, Theorem 3.4] If p is a prime, then
The authors in [Citation19] also evaluated the Wiener index of line graph of the prime graph Note that the line graph
of the graph
is defined as the graph whose set of vertices constitutes of the edges of
where two vertices are adjacent if the corresponding edges have a common vertex in
Theorem 4.5.
[Citation19, Theorem 4.19] Let n = 4 or an odd prime, then
Let us close the section, by mentioning some open problems in the subject area.
Question 4.6. Find the Wiener index of for
where p is prime and
Question 4.7. Find the Wiener index of 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 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
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.