SS symmetry

Article
On Eccentric Topological Indices Based on Edges of
Zero Divisor Graphs
Ali N. A. Koam 1 , Ali Ahmad 2, * and Azeem Haider 1
1 Department of Mathematics, College of Science, Jazan University, New Campus, Jazan 2097, Saudi Arabia
2 College of Computer Science and Information Technology, Jazan University, Jazan 45142, Saudi Arabia
* Correspondence: [email protected]




Received: 18 June 2019; Accepted: 9 July 2019; Published: 12 July 2019


Abstract: This article is devoted to the determination of edge-based eccentric topological indices
of a zero divisor graph of some algebraic structures. In particular, we computed the first Zagreb
eccentricity index, third Zagreb eccentricity index, geometric-arithmetic eccentricity index, atom-bond
connectivity eccentricity index and a fourth type of eccentric harmonic index for zero divisor graphs
associated with a class of finite commutative rings.

Keywords: eccentricity; topological index; zero divisor graphs; commutative ring

MSC: 05C12; 05C10; 05C90

1. Introduction
Algebraic structures have been studied for their close affiliation with representation theory and
number theory, and they have been extensively studied in combinatorics [1,2]. In addition to the
extensive theoretical research in these areas, finite rings and fields have received attention for their
applications to cryptography and coding theory.
A foundational role of molecular descriptors is to consider molecules as real bodies and transform
them into numbers, which enables mathematics to play a key role in chemistry, pharmaceutical sciences,
environmental protection, quality control and health research. These molecular descriptors are graph
invariants and are usually known as topological indices. In graph theory, by using topological indices
we correlate various characteristics of a chemical structure in order to characterize it. These days there
is an area of research devoted to computing topological indices for various structures.
In mathematical chemistry, a molecular or chemical graph is a presentation of the structural
formula of a chemical compound in the form of graph structures. A chemical graph is a labeled graph
with corresponding vertices representing the atoms of the compound and edges representing their
chemical bonds. A topological index associated with a chemical graph is a numeric value which
remains invariant under the graph automorphism and it also characterizes the topology of a chemical
graph. Hence, these indices have a variety of applications in chemistry as well as in pharmaceutical
science and in the structures of nanotubes [3,4]. For graph theory, topological indices are classified as
“topological indices based on degrees” [5–8], “topological indices based on distances” and “topological
indices based on eccentricities” of graphs. Some well-known topological indices based on the degrees
of a graph are the Randi connectivity index, Zagreb indices, Harmonic index, atom bond connectivity,
geometric arithmetic index and so forth, and the Wiener index, Hosaya index and Estrada index are
distance based topological indices [9,10]. Similarly, eccentricity based topological indices include the
Zagreb eccentricity index [11,12], geometric-arithmetic eccentricity index [13], connectivity of atomic
bond eccentricity index [14] and the fourth type of eccentric harmonic index [15,16]. Topological

Symmetry 2019, 11, 907; doi:10.3390/sym11070907 www.mdpi.com/journal/symmetry

Symmetry 2019, 11, 907 2 of 11

indices lay the criteria for the growth of chemical structures and how mathematical operations on the
graphs, with the relief of topological indices, can extend multidisciplinary research.

2. Motivation behind Topological Indices

An association between the stability of linear alkanes and the branched alkanes is studied through
the ABC index. This index is also used for the computation of strain energy for cyclo alkanes [17,18].
In order to correlate certain physico-chemical characteristics, the GA index has more efficient predictive
power than does the Randic connectivity index [19,20]. The Zagreb indices (first and second) are
powerful tools for the computation of total p-electron energy of the molecules within a particular
approximate expression [21]. The topological indices that are based on degrees are more useful for
examining the chemical characteristics of distinct molecular structures. These applications provide a
motivation to study topological indices that are eccentricity based. The topological indices based on
eccentricity are useful for the assessment of the toxicological, physico-chemical and pharmacological
characteristics of a compound through the structure of its molecules. The study of the QSAR
(quantitative structure activity relationship) is known for this sort of analysis [22]. In order to obtain
further details on the applications of Topological indices see References [23,24].

3. Methods
In order to obtain our intended outcomes we used combinatorial tools such as vertex partition,
edge partition, eccentricity, eccentricity counting for each degree and other graph theoretical methods
with some analytic techniques [23,25]. Moreover, we use C ++ for the verification of degree and their
corresponding eccentricity.

4. Definitions and Notations

Let G be a connected graph with vertex set V ( G ) and edge set E( G ). We associate with each graph
G a numerical value, called the topological index (descriptor). This index remains invariant under
graph automorphisms. The number of edges adjacent to a vertex v is called the degree of v which is
denoted by d(v) and the corresponding maximum and minimum degree of a vertex in a graph G is
denoted by ∆( G ) and δ( G ) respectively. The d(u, v) denotes the distance between any two vertices u
and v which is defined as the number of edges in the shortest path between the vertices u and v. The
eccentricity of a vertex v in a graph G is defined as:

ε v = max{d(v, u) : u ∈ V ( G )}. (1)

We study general topological invariant T ( G ) based on the eccentricity of vertices in graph G.

T (G) = ∑ φ ( eu , ev ), (2)
uv∈ E( G )

where φ(eu , ev ) = φ(ev , eu ) is a real function of eu and ev .

• If φ(eu , ev ) = (eu + ev ) β , where β 6= 0 is a real number, then φ( G ) is the first Zagreb eccentricity
index if β = 1 [11,12].
• If φ(eu , ev ) = (eu × ev )α , where α 6= 0 is a real number, then φ( G ) is the third Zagreb eccentricity
index if α = 1 [11,12].
√
2 e ×e
• If φ(eu , ev ) = eu +u ev v , we obtain the geometric-arithmetic eccentricity index GA4 ( G ) [13].
q
ev −2
• If φ(eu , ev ) = eue+ u × ev
, we obtain the atom-bond connectivity eccentricity index ABC5 ( G ) [14].
2
• If φ(eu , ev ) = eu + ev , we obtain the fourth type of eccentric harmonic index H4 ( G ) [15,16].

A commutative ring R with identity a non-zero element x ∈ R is called a zero divisor if there
exists another non zero element y ∈ R such that x.y = 0 in R. The set of all zero divisors in R is denoted
Symmetry 2019, 11, 907 3 of 11

by Z ( R). By considering a finite commutative ring R, we associate a zero divisor graph G ( R) such
that if x1 , x2 ∈ Z ( R) = V ( G ( R)) and ( x1 , x2 ) ∈ E( G ( R)) if and only if x1 .x2 = 0. The notion of the
zero divisor graph was introduced by Beck [2] and later for any commutative ring R, Anderson and
Livingston, in Reference [26], proved that the zero divisor graph G ( R) is a connected graph. Due
to broad interest in parameters associated with graphs and rings, several authors investigated the
associated identities of zero-divisor for commutative rings, see for example References [23,27,28].

5. Main Results
For positive integers a, b ∈ Z+ , we consider G ( R) to be a zero divisor graph of commutative ring
R = Za × Zb whose vertex set is V ( G ( R)) and edge set is E( G ( R)). Then
 
V ( G ( R)) = ( x, y) ∈ R : x ∈ Z (Za ) ∪ {0} or y ∈ Z (Zb ) ∪ {0} \ (0, 0)

and


E( G ( R)) = ( x1 , y1 ), ( x2 , y2 ) ∈ V ( G ( R)) × V ( G ( R)) : ( x1 x2 , y1 y2 ) = (0, 0) in R .
This section is devoted on the discussion of eccentric topological indices based on the edges of zero
divisor graphs for rings Za × Zb with a = p1 p2 , p2 and b = q2 , where p1 , p2 , p and q are prime numbers.

5.1. Case 1: Z p1 p2 × Zq2

Let Γ R be a zero divisor graph of commutative ring R = Z p1 p2 × Zq2 , where p1 , p2 , q are prime
numbers with p1 6= p2 , in this subsection we discuss the eccentric topological indices for Γ R .

Theorem 1. Let Γ R be the zero divisor graph of commutative ring R = Z p1 p2 × Zq2 , where p1 , p2 , q are
prime numbers with p1 6= p2 . Then |V (Γ R )| = q2 ( p2 + p1 − 1) + q( p2 − 1)( p1 − 1) − 1 and | E(Γ R )| =
q2 (5p1 p2 − 3p1 − 3p2 + 23 ) + q(−4p1 p2 + 2p1 + 2p2 − 32 ) + 1.

Proof. Let (u, v) ∈ V (Γ R ). Then we have following cases:

1. If u = 0 and for any v ∈ Zq2 with v 6= kq, 0 ≤ k ≤ q − 1, then each (0, v) of this type is connected
to the vertices of type (u0 , 0) for all u0 ∈ Z p1 p2 \ {0}. Hence the degree of each such vertex is
p1 p2 − 1. Similarly if u ∈ Z p1 p2 \ {0, t1 p1 , t2 p2 with 1 ≤ t1 ≤ p2 − 1, 1 ≤ t2 ≤ p1 − 1} and v = 0,
then the degree of each such vertex is q2 − 1.
2. If u = 0 and v = kq, 1 ≤ k ≤ q − 1, then each such vertex (0, v) is connected to the vertices of types
(u1 , 0), (0, v0 ), (u2 , v0 ), (u3 , v0 ) and (u4 , v0 ) for every u1 ∈ Z p1 p2 \ {0}, u2 = t1 p1 , 1 ≤ t1 ≤ p2 − 1,
u3 = t2 p2 , 1 ≤ t2 ≤ p1 − 1, u4 6= t1 p1 , 0 ≤ t1 ≤ p2 − 1, u4 6= t2 p2 , 0 ≤ t2 ≤ p1 − 1 and
v0 = tq, 1 ≤ k ≤ q − 1 with t 6= k. Hence the degree of each such vertex is p1 p2 − 1 + q − 2 +
( p1 − 1)(q − 1) + ( p2 − 1)(q − 1) + ( p2 − 1)( p1 − 1)(q − 1) = p1 p2 − 2 + ( p2 + p1 − 1)(q − 1) +
( p2 − 1)( p1 − 1)(q − 1) = p1 p2 q − 2.
3. If u = t1 p1 , 1 ≤ t1 ≤ p2 − 1 and v = 0, then each such vertex (u, 0) is connected to the vertices
of type (0, v1 ), (u0 , 0), (u0 , v2 ) and (u0 , v3 ) for every v1 ∈ Zq2 \ {0}, u0 = t2 p2 , 1 ≤ t2 ≤ p1 − 1,
v2 6= kq, 0 ≤ k ≤ q − 1 and v3 = kq, 1 ≤ k ≤ q − 1. Therefore the degree of each such vertex is
q2 − 1 + p1 − 1 + ( p1 − 1)(q2 − q) + ( p1 − 1)(q − 1) = p1 q2 − 1. Similarly if u = t2 p2 , 1 ≤ t2 ≤
p1 − 1 and v = 0, then the degree of each such vertices is p2 q2 − 1.
4. If u = t1 p1 , 1 ≤ t1 ≤ p2 − 1 and v 6= kq, 0 ≤ k ≤ q − 1, then each such vertex (u, v) is connected
to vertex (u0 , 0) for every u0 = t2 p2 , 1 ≤ t2 ≤ p1 − 1. Hence the degree of each such vertex is
p1 − 1. Similarly if u = t2 p2 , 1 ≤ t2 ≤ p1 − 1 and v 6= kq, 0 ≤ k ≤ q − 1, then the degree of each
such vertex is p2 − 1.
5. If u = t1 p1 , 1 ≤ t1 ≤ p2 − 1 and v = kq, 1 ≤ k ≤ q − 1, then each such vertex (u, v) is connected
to the vertices of type (u0 , 0), (0, v0 ) and (u0 , v0 ) for every u0 = t2 p2 , 1 ≤ t2 ≤ p1 − 1, v0 = kq, 1 ≤
k ≤ q − 1. Therefore the degree of each such vertex is p1 − 1 + q − 1 + ( p1 − 1)(q − 1) = p1 q − 1.
Symmetry 2019, 11, 907 4 of 11

Similarly, if u = t2 p2 , 1 ≤ t2 ≤ p1 − 1 and v = kq, 1 ≤ k ≤ q − 1, then the degree of each such

vertex is p2 q − 1.
6. If u 6= t1 p1 and u 6= t2 p2 , 0 ≤ t1 ≤ p2 − 1, 0 ≤ t2 ≤ p1 − 1 and v = kq, 1 ≤ k ≤ q − 1, then each
such vertex (u, v) is connected to the vertex (0, v0 ) for every v0 = kq, 1 ≤ k ≤ q − 1. Hence the
degree of each such vertex (u, v) is q − 1.

The total number of vertices of Γ R from the above cases is:

q2 − q + ( p2 − 1)( p1 − 1) + q − 1 + p2 − 1 + p1 − 1 + ( p2 − 1)(q2 − q) + ( p1 − 1)(q2 − q) + ( p2 − 1)

(q − 1) + ( p1 − 1)(q − 1) + ( p2 − 1)( p1 − 1)(q − 1)
= (q2 − 1)( p2 + p1 − 2) + p2 p1 + q2 − 2 + ( p2 − 1)( p1 − 1)(q − 1)
= q2 ( p2 + p1 − 1) + q( p2 − 1)( p1 − 1) − 1.

Hence, |V (Γ R )| = q2 ( p2 + p1 − 1) + q( p2 − 1)( p1 − 1) − 1.
The total number of edges of Γ R is obtained by using hand shaking lemma as:

∑ deg(v)
v ∈V ( Γ R )
| E(Γ R )| = 2 = 21 {(q2 − q)( p1 p2 − 1) + ( p1 − 1)( p2 − 1)(q2 − 1) + (q − 1)( p1 p2 q − 2) +
( p1 − 1)( p2 q − 1) + ( p2 − 1)( p1 q2 − 1) + ( p2 − 1)(q2 − q)( p1 − 1) + ( p1 − 1)(q2 − q)( p2 − 1) + ( p2 −
2

1)(q − 1)( p1 q − 1) + ( p1 − 1)(q − 1)( p2 q − 1) + (q − 1)2 ( p1 − 1)( p2 − 1)}.

After simplification we get, | E(Γ R )| = q2 (5p1 p2 − 3p1 − 3p2 + 32 ) + q(−4p1 p2 + 2p1 + 2p2 − 32 ) + 1.

From the proof of Theorem 1 and our convenance, we partition the vertex set of Γ R as follows:

∨1 ={(0, v) : v ∈ Zq2 , v 6= kq, 0 ≤ k ≤ q − 1}

∨2 ={(0, v) : v = kq, 1 ≤ k ≤ q − 1}
∨3 ={(u, 0) : u = t1 p1 , 1 ≤ t1 ≤ p2 − 1}
∨4 ={(u, 0) : u = t2 p2 , 1 ≤ t2 ≤ p1 − 1}
∨5 ={(u, 0) : u 6= t1 p1 , u 6= t2 p2 , 1 ≤ t1 ≤ p2 − 1, 1 ≤ t2 ≤ p1 − 1}
∨6 ={(u, v) : u = t1 p1 , v 6= kq, 1 ≤ t1 ≤ p2 − 1, 0 ≤ k ≤ q − 1}
∨7 ={(u, v) : u = t2 p2 , v 6= kq, 1 ≤ t2 ≤ p1 − 1, 0 ≤ k ≤ q − 1}
∨8 ={(u, v) : u = t1 p1 , v = kq, 1 ≤ t1 ≤ p2 − 1, 1 ≤ k ≤ q − 1}
∨9 ={(u, v) : u = t2 p2 , v = kq, 1 ≤ t2 ≤ p1 − 1, 1 ≤ k ≤ q − 1}
∨10 ={(u, v) : u 6= t1 p1 , u 6= t2 p2 , v = kq, 1 ≤ t1 ≤ p2 − 1, 1 ≤ t2 ≤ p1 − 1, 1 ≤ k ≤ q − 1}

10
This shows that V (Γ R ) = ∨i . It is observed that | ∨1 | = q2 − q, | ∨2 | = q − 1, | ∨3 | = p2 − 1,
F
i =1
| ∨4 | = p1 − 1, | ∨5 | = ( p1 − 1)( p2 − 1), | ∨6 | = ( p2 − 1)(q2 − q), | ∨7 | = ( p1 − 1)(q2 − q), | ∨8 | =
( p2 − 1)(q − 1), | ∨9 | = ( p1 − 1)(q − 1) and | ∨10 | = ( p1 − 1)( p2 − 1)(q − 1). Let the degree of
a vertex u in set A be denoted by d A (u) and the distance between two vertices sets X and Y be
d( X, Y ) = d(Y, X ). Then following theorem determines the eccentricity of the vertices in graph Γ R .

Theorem 2. If p1 , p2 and q are prime numbers such that p1 6= p2 and the associated zero divisor graph Γ R to
the commutative ring R = Z p1 p2 × Zq2 , then the eccentricity of the vertices of corresponding graph Γ R is either
2 or 3.

Proof. It is easy to see from the proof of Theorem 1 that, d(∨1 , ∨3 ) = d(∨1 , ∨4 ) = d(∨1 , ∨5 ) =
d(∨2 , ∨2 ) = d(∨2 , ∨3 ) = d(∨2 , ∨4 ) = d(∨2 , ∨5 ) = d(∨2 , ∨8 ) = d(∨2 , ∨9 ) = d(∨2 , ∨10 ) = d(∨3 , ∨4 ) =
d(∨3 , ∨7 ) = d(∨3 , ∨9 ) = d(∨4 , ∨6 ) = d(∨4 , ∨8 ) = d(∨8 , ∨9 ) = 1.
Symmetry 2019, 11, 907 5 of 11

d(∨1 , ∨2 ) =d(∨1 , ∨3 ) + d(∨3 , ∨2 ) = 1 + 1 = 2

d(∨1 , ∨6 ) =d(∨1 , ∨4 ) + d(∨4 , ∨6 ) = 1 + 1 = 2
d(∨1 , ∨7 ) =d(∨1 , ∨3 ) + d(∨3 , ∨7 ) = 1 + 1 = 2
d(∨1 , ∨8 ) =d(∨1 , ∨4 ) + d(∨4 , ∨8 ) = 1 + 1 = 2
d(∨1 , ∨9 ) =d(∨1 , ∨3 ) + d(∨3 , ∨9 ) = 1 + 1 = 2
d(∨1 , ∨10 ) =d(∨1 , ∨2 ) + d(∨2 , ∨10 ) = 2 + 1 = 3
d(∨1 , ∨1 ) =d(∨1 , ∨3 ) + d(∨3 , ∨1 ) = 1 + 1 = 2

Hence the eccentricity of the corresponding vertices of set ∨1 is 3 i.e., e(∨1 ) = 3. Similarly, we can see
that max{d(∨s , ∨t )} = 2 for s = 2, 3, 4 and 1 ≤ t ≤ 10. Therefore, e(∨2 ) = e(∨3 ) = e(∨4 ) = 2.
As d(∨5 , ∨6 ) = d(∨5 , ∨1 ) + d(∨1 , ∨6 ) = 1 + 2 = 3 and max{d(∨5 , ∨t )} = 3 for 1 ≤ t ≤ 10.
This shows e(∨5 ) = 3. Similarly, it is easy to calculate max{d(∨s , ∨t )} = 3 for s = 6, 7, 8, 9, 10 and
1 ≤ t ≤ 10. This implies e(∨10 ) = e(∨9 ) = e(∨8 ) = e(∨7 ) = e(∨6 ) = 3.

Lemma 1. For any three prime numbers p1 , p2 and q such that p1 6= p2 and the associated zero divisor graph
Γ R of commutative ring R = Z p1 p2 × Zq2 we have,
  
T (Γ R ) = φ(2, 2) + qφ(2, 3) (q − 1)( p2 + p1 − 2) + φ(2, 2) + (2q2 + q − 3)φ(2, 3) + (2q2 − 3q +
  
( q −1)
1)φ(3, 3) ( p2 − 1)( p1 − 1) + (q − 2)φ(2, 2) + 2(q − 1)( p1 p2 − 1)φ(2, 3) 2 .

Proof. The graph Γ R contains q2 ( p2 + p1 − 1) + q( p2 − 1)( p1 − 1) − 1 vertices and q2 (5p1 p2 − 3p1 −

3p2 + 32 ) + q(−4p1 p2 + 2p1 + 2p2 − 32 ) + 1 edges. Let us divide the edges of Γ R into partition sets
according to the eccentricity of its end vertices.

Ξr,s = {uv ∈ E(Γ R ) : eu = r, ev = s}.

This means that the set Ξr,s contains the edges incident with one vertex of eccentricity r and the other
vertex of eccentricity s. From the Theorem 1 and Theorem 2, we have |Ξ2,2 | = ( p2 + p1 − 2)(q − 1) +
( p2 − 1)( p1 − 1) + (q−1)(2 q−2) , |Ξ2,3 | = 2(q2 − 1)( p2 − 1)( p1 − 1) + (q − 1)2 ( p1 p2 − 1) + (q2 − q)( p2 +
p1 − 2) + (q − 1)( p2 − 1)( p1 − 1), |Ξ3,3 | = ( p2 − 1)( p1 − 1)(2q2 − 3q + 1) and E(Γ R ) = Ξ2,2 ∪ Ξ2,3 ∪ Ξ3,3 .
Then

T ( G1 ) = ∑ φ ( eu , ev )
uv∈ E(Γ R )

= ∑ φ(2, 2) + ∑ φ(2, 3) + ∑ φ(3, 3)

uv∈Ξ2,2 uv∈Ξ2,3 uv∈Ξ3,3

(q − 1)(q − 2)
=( p2 + p1 − 2)(q − 1)φ(2, 2) + ( p2 − 1)( p1 − 1)φ(2, 2) + φ(2, 2)
 2 
2 2 2
+ 2( p2 − 1)( p1 − 1)(q − 1) + (q − 1) ( p1 p2 − 1) + (q − q)( p2 + p1 − 2) φ(2, 3)

+(q − 1)( p2 − 1)( p1 − 1)φ(2, 3) + ( p2 − 1)( p1 − 1)(2q2 − 3q + 1)φ(3, 3)

( q − 1)
={φ(2, 2) + qφ(2, 3)}(q − 1)( p2 + p1 − 2) + {(q − 2)φ(2, 2) + 2(q − 1)( p1 p2 − 1)φ(2, 3)}
  2
2 2
+ φ(2, 2) + (2q + q − 3)φ(2, 3) + (2q − 3q + 1)φ(3, 3) ( p2 − 1)( p1 − 1).

Now we present values of the eccentric topological indices of the graph Γ R which are edge-based.
Symmetry 2019, 11, 907 6 of 11

Theorem 3. If p1 , p2 and q are prime numbers such that p1 6= p2 and the associated zero divisor graph Γ R to
the commutative ring R = Z p1 p2 × Zq2 , then

the First Zagreb eccentricity index of Γ R is:

q −1
M1∗ (Γ R ) = (5q + 4)(q − 1)( p2 + p1 − 2) + (10p1 p2 q − 10p1 p2 − 6q + 2) 2 + (22q2 − 13q − 5)( p2 −
1)( p1 − 1),

the third Zagreb eccentricity index is:

M3∗ (Γ R ) = (6q + 4)(q − 1)( p2 + p1 − 2) + 2(q − 1)(3p1 p2 q − 3p1 p2 − 2q + 1) + (30q2 − 21q − 5)( p2 −
1)( p1 − 1),

the geometric-arithmetic eccentricity index is:

√ √ √
(q−1)(q−2) 6+10 2
GA4 (Γ R ) = ( 2 5 6 q + 1)(q − 1)( p2 + p1 − 2) + 2 + 2 6
5 (q − 1)2 ( p1 p2 − 1) + ( 4 5 q +
√ √
2 6−15
5 q + 10−56 6 )( p2 − 1)( p1 − 1),

the atom-bond connectivity eccentricity index is:

√ √ √ √
2 2 2( q −1) 2+4 2 2−4
ABC5 (Γ R ) =
√ 2 (q − 1)( p2 + p1 − 2) + 4 (2p1 p2 q − 2p1 p2 − q) + ( 3 3 q + 2 q +
2−3 2
3 )( p2 − 1)( p1 − 1),

the fourth type of eccentric harmonic index is:

 
4q+5 ( q −1) 4
H4 (Γ R ) = 10 ( q − 1)( p2 + p1 − 2) + 2 ( 5 p1 p2 q − 45 p1 p2 − 3
10 q − 15 ) + 22 2
15 q − 35 q − 11
30 ( p2 −
1)( p1 − 1).

Proof. For the first Zagreb eccentricity index M1∗ (ΓR ) of ΓR we obtain φ(eu , ev ) = eu + ev . So φ(2, 2) = 4,
φ(2, 3) = 5 and φ(3, 3) = 6. Thus by Lemma 1,

q−1
M1∗ (Γ R ) = (4 + 5q) (q − 1)( p2 + p1 − 2) + (4(q − 2) + 10(q − 1)( p1 p2 − 1))
  2
2 2
+ 4 + 5(2q + q − 3) + 6(2q − 3q + 1) ( p2 − 1)( p1 − 1)
q−1
=(5q + 4)(q − 1)( p2 + p1 − 2) + (10p1 p2 q − 10p1 p2 − 6q + 2)
2
+(22q2 − 13q − 5)( p2 − 1)( p1 − 1).

For the third Zagreb eccentricity index M3∗ (Γ R ) of Γ R we obtain φ(eu , ev ) = eu × ev . So φ(2, 2) = 4,
φ(2, 3) = 6 and φ(3, 3) = 9 So by Lemma 1,

q−1
M3∗ (Γ R ) = (4 + 6q) (q − 1)( p2 + p1 − 2) + (4(q − 2) + 12(q − 1)( p1 p2 − 1))
  2
2 2
+ 4 + 6(2q + q − 3) + 9(2q − 3q + 1) ( p2 − 1)( p1 − 1)
=(6q + 4)(q − 1)( p2 + p1 − 2) + 2(q − 1)(3p1 p2 q − 3p1 p2 − 2q + 1)
+(30q2 − 21q − 5)( p2 − 1)( p1 − 1).
Symmetry 2019, 11, 907 7 of 11

√
2 eu × ev
For the geometric-arithmetic eccentricity index GA4 (Γ R ) of Γ R , we get φ(eu , ev ) = eu + ev . So
√
2 6
φ(2, 2) = 1, φ(2, 3) = 5 and φ(3, 3) = 1. Therefore,
√ ! √
2 6 2 6 q−1
GA4 (Γ R ) = 1+ q (q − 1)( p2 + p1 − 2) + ((q − 2) + 2(q − 1)( p1 p2 − 1) )
5 5 2
√ !
2 6
+ 1+ (2q2 + q − 3) + (2q2 − 3q + 1) ( p2 − 1)( p1 − 1)
5
√ ! √
2 6 (q − 1)(q − 2) 2 6
= q + 1 (q − 1)( p2 + p1 − 2) + + ( q − 1)2 ( p1 p2 − 1)
5 2 5
√ √ √ !
4 6 + 10 2 2 6 − 15 10 − 6 6
+ q + q+ ( p2 − 1)( p1 − 1).
5 5 5
q
eu + ev −2
For the atom-bond connectivity eccentricity index ABC5 (Γ R ) of Γ R , we obtain φ(eu , ev ) = eu × ev .
Thus φ(2, 2) = φ(2, 3) = √1 and φ(3, 3) = 2
Therefore,
2 3

q−1
   
1 1 1 1
ABC5 (Γ R ) = √ + √ q (q − 1)( p2 + p1 − 2) + √ (q − 2) + 2(q − 1)( p1 p2 − 1) √
2 2 2 2 2
 
1 1 2
+ √ + √ (2q2 + q − 3) + (2q2 − 3q + 1) ( p2 − 1)( p1 − 1)
2 2 3
√ √
2 2 2( q − 1)
= (q − 1)( p2 + p1 − 2) + (2p1 p2 q − 2p1 p2 − q)
2 4 !
√ √ √
3 2+4 2 2−4 2−3 2
+ q + q+ ( p2 − 1)( p1 − 1).
3 2 3

For the fourth type of eccentric harmonic index H4 (Γ R ) of Γ R , we get φ(eu , ev ) = 2

eu + ev , therefore
φ(2, 2) = 12 , φ(2, 3) = 25 and φ(3, 3) = 31 . Thus,

2 q−1
   
1 2 1
H4 (Γ R ) = + q (q − 1)( p2 + p1 − 2) + (q − 2) + 2(q − 1)( p1 p2 − 1)
2 5 2 5 2
 
1 2 1
+ + (2q2 + q − 3) + (2q2 − 3q + 1) ( p2 − 1)( p1 − 1)
2 5 3
4q + 5 ( q − 1) 4 4 3 1
= (q − 1)( p2 + p1 − 2) + ( p1 p2 q − p1 p2 − q − )
 10  2 5 5 10 5
22 2 3 11
+ q − q− ( p2 − 1)( p1 − 1).
15 5 30

5.2. Case 2: Z p2 × Zq2

In this subsection, we discuss the eccentric topological indices for zero divisor graph Υ R defined
on commutative ring R = Z p2 × Zq2 , where p, q are prime numbers.

Theorem 4. Let p and q be prime numbers and Υ R be the zero divisor graph of commutative ring R =
( p−1)(q−1)(5pq−2)+2p2 q2 − p2 q− pq2 −2p−2q+4
Z p2 × Zq2 . Then |V (Υ R )| = p2 q + pq2 − pq − 1 and | E(Υ R )| = 2 .

Proof. For any two prime numbers p and q, we consider the ring R = Z p2 × Zq2 with usual operations.
The associated zero divisor graph Υ R on ring R is defined as: Any (u, v) ∈ V (Υ R ) if and only if the
elements u = kp, 0 ≤ k ≤ p − 1 or v = tq, 0 ≤ t ≤ q − 1 with (u, v) 6= (0, 0). Therefore, a non zero
Symmetry 2019, 11, 907 8 of 11

element (u, v) is not a zero divisor in the ring R if and only if u is not a multiple of p and v is not
a multiple of q. As the number of elements in Z p2 which are not a multiple of p are p2 − p and the
number of elements in Zq2 which are not a multiple of q are q2 − q. Also, the element (0, 0) is not a
zero divisor in R. Thus the total number of non zero divisors in the ring R is ( p2 − p)(q2 − q) + 1.
This implies  
|V (Υ R )| = p2 q2 − ( p2 − p)(q2 − q) + 1 = p2 q + pq2 − pq − 1.

For any (u, v) ∈ V (Υ R ), we discuss the degree of each vertex as follows:

1. If u = 0 and v is not a multiple of q, then vertex (0, v) of this form is connected to each vertex
(u0 , 0), where u0 ∈ Z p2 \ {0}. Hence each vertex (0, v) has degree p2 − 1. By symmetry each vertex
(u, 0) such that u is not a multiple of p has degree q2 − 1.
2. If u = 0 and v ∈ {q, 2q, . . . , (q − 1)q}, then vertex (0, v) of this form is connected to each vertex
(u0 , v0 ), where u0 ∈ Z p2 and v0 ∈ {0, q, 2q, . . . , (q − 1)q} with (u0 , v0 ) 6∈ {(0, 0), (0, v)}. Hence the
each vertex of this type (0, v) has degree p2 q − 2. By symmetry the degree of each vertex (u, 0)
such that u ∈ { p, 2p, . . . , ( p − 1) p} is pq2 − 2.
3. If u is not a multiple of p and v ∈ {q, 2q, . . . , (q − 1)q}, then each vertex (u, v) is connected to each
vertex (0, v0 ), v0 ∈ {q, 2q, . . . , (q − 1)q}. Hence each vertex (u, v) of this type has degree q − 1.
By symmetry the degree of each vertex (u, v) if u ∈ { p, 2p, . . . , ( p − 1) p} and v is not a multiple
of q is p − 1.
4. If u ∈ { p, 2p, . . . , ( p − 1) p} and v ∈ {q, 2q, . . . , (q − 1)q}, then each vertex (u, v) of this form is
connected to each vertex (u0 , v0 ), where u0 ∈ {0, p, 2p, . . . , ( p − 1) p} and v0 ∈ {0, q, 2q, . . . , (q −
1)q} with (u0 , v0 ) 6∈ {(0, 0), (0, v)}. Hence the degree of each vertex (u, v) is pq − 2.

From the above discussion, it is easy to see that the zero divisor graph Υ R contains q2 − q
vertices of degree p2 − 1, p2 − p vertices of degree q2 − 1, p − 1 vertices of degree pq2 − 2, q − 1
vertices of degree qp2 − 2, q( p − 1)(q − 1) vertices of degree p − 1, p( p − 1)(q − 1) vertices of
degree q − 1 and ( p − 1)(q − 1) vertices of degree pq − 2. By using the hand shaking lemma the
number of edges of Υ R are | E(Υ R )| = 12 (( p2 − 1)(q2 − q) + (q2 − 1)( p2 − p) + ( pq2 − 2)( p − 1) +
(qp2 − 2)(q − 1) + ( p − 1)q( p − 1)(q − 1) + (q − 1) p( p − 1)(q − 1) + ( pq − 2)( p − 1)(q − 1)) =
( p−1)(q−1)(5pq−2)+2p2 q2 − p2 q− pq2 −2p−2q+4
2 .

Let =i denotes the set of containing the vertices of degree i. From the proof of Theorem 4,
we get |= p2 −1 | = q2 − q, |=q2 −1 | = p2 − p, |= pq2 −2 | = p − 1, |=qp2 −2 | = q − 1, |= p−1 | =
q( p − 1)(q − 1), |=q−1 | = p( p − 1)(q − 1) and |= pq−2 | = ( p − 1)(q − 1). The following theorem
determines the eccentricity of the vertices in graph of Υ R .

Theorem 5. Let p and q be two prime numbers and Υ R be the zero divisor graph of commutative ring
R = Z p2 × Zq2 . Then the eccentricity of a vertex of Υ R is either 2 or 3.

Proof. Similar proof of Theorem 2, we get e(= pq2 −2 ) = e(=qp2 −2 ) = e(= pq−2 ) = 2 and e(= p2 −1 ) =
e(=q2 −1 ) = e(= p−1 ) = e(=q−1 ) = 3.

Lemma 2. Let p and q be two prime numbers and Υ R be the zero divisor graph of commutative ring R =
Z p2 × Zq2 . Then

p2 q + pq2 − 4pq + 2
 
φ(2, 2)
T (Υ R ) = φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3) .
2 2

( p−1)(q−1)(5pq−2)+2p2 q2 − p2 q− pq2 −2p−2q+4

Proof. The graph Υ R contains p2 q + pq2 − pq − 1 vertices and 2
edges. Let us divide the edges of Υ R into partition sets with respect to the degree of endpoints of each
edge as:
Symmetry 2019, 11, 907 9 of 11

Ξr,s = {uv ∈ E(Υ R ) : eu = r, ev = s}.

This means that the set Ξr,s contains the edges incident with one vertex of eccentricity r and the
( p−1)( p−2)
other vertex of eccentricity s. From the Theorem 4 and Theorem 5, we get |Ξ2,2 | = 2 +
(q−1)(q−2)
2 + ( p−1)(q−1)(2pq+ p+q−2) , |Ξ2,3 | = 2pq( p − 1)(q − 1), |Ξ3,3 | = pq( p − 1)(q − 1) and E(Υ R ) =
Ξ2,2 ∪ Ξ2,3 ∪ Ξ3,3 . Then

T (Υ R ) = ∑ φ ( eu , ev )
uv∈ E( GR )

= ∑ φ(2, 2) + ∑ φ(2, 3) + ∑ φ(3, 3)

uv∈Ξ2,2 uv∈Ξ2,3 uv∈Ξ3,3

( p − 1)( p − 2) (q − 1)(q − 2) ( p − 1)(q − 1)( pq + p + q − 2)

 
= + + φ(2, 2)
2 2 2
+2pq( p − 1)(q − 1)φ(2, 3) + pq( p − 1)(q − 1)φ(3, 3)
p2 q + pq2 − 4pq + 2
 
φ(2, 2)
= φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3) .
2 2

Now we present values of eccentric topological indices based on edges of graph Υ R .

Theorem 6. Let p and q be two prime numbers and Υ R be the zero divisor graph of commutative ring
R = Z p2 × Zq2 . Then the First Zagreb eccentricity index of Υ R is:

M1∗ (Υ R ) = 2( p2 q + pq2 − 4pq + 2) + 18pq( p − 1)(q − 1)

the third Zagreb eccentricity index is:

M3∗ (Υ R ) = 2( p2 q + pq2 − 4pq + 2) + 23pq( p − 1)(q − 1)

the geometric-arithmetic eccentricity index is:

√ !
p2 q + pq2 − 4pq + 2 15 + 8 6
GA4 (Υ R ) = + pq( p − 1)(q − 1)
2 10

the atom-bond connectivity eccentricity index is:

√ !
p2 q + pq2 − 4pq + 2 15 + 4 2
ABC5 (Υ R ) = √ + pq( p − 1)(q − 1) √
2 2 6 2
the fourth type of eccentric harmonic index is:

p2 q + pq2 − 4pq + 2 83
H4 (Υ R ) = + pq( p − 1)(q − 1).
4 60

Proof. For the first Zagreb eccentricity index M1∗ (ΥR ) of ΥR we obtain φ(eu , ev ) = eu + ev . So φ(2, 2) = 4,
φ(2, 3) = 5 and φ(3, 3) = 6. Thus by Lemma 2,

p2 q + pq2 − 4pq + 2
 
φ(2, 2)
M1∗ (Υ R ) = φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3)
2 2
=2( p2 q + pq2 − 4pq + 2) + 18pq( p − 1)(q − 1).

For the third Zagreb eccentricity index M3∗ (Υ R ) of Υ R we obtain φ(eu , ev ) = eu × ev . So φ(2, 2) = 4,
φ(2, 3) = 6 and φ(3, 3) = 9 So by Lemma 2,
Symmetry 2019, 11, 907 10 of 11

p2 q + pq2 − 4pq + 2
 
φ(2, 2)
M3∗ (Υ R ) = φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3)
2 2
=2( p2 q + pq2 − 4pq + 2) + 23pq( p − 1)(q − 1).
√
2 eu × ev
For the geometric-arithmetic eccentricity index GA4 (Υ R ) of Υ R , we get φ(eu , ev ) = eu + ev . So
√
2 6
φ(2, 2) = 1, φ(2, 3) = 5 and φ(3, 3) = 1. Therefore,

p2 q + pq2 − 4pq + 2
 
φ(2, 2)
GA4 (Υ R ) = φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3)
2 2
√ !
p2 q + pq2 − 4pq + 2 15 + 8 6
= + pq( p − 1)(q − 1) .
2 10
q
eu + ev −2
For the atom-bond connectivity eccentricity index ABC5 (Υ R ) of Υ R , we obtain φ(eu , ev ) = eu × ev .
Thus φ(2, 2) = φ(2, 3) = √1 and φ(3, 3) = 2
Therefore,
2 3

p2 q + pq2 − 4pq + 2
 
φ(2, 2)
ABC5 (Υ R ) = φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3)
2 2
√ !
p2 q + pq2 − 4pq + 2 15 + 4 2
= √ + pq( p − 1)(q − 1) √
2 2 6 2

For the fourth type of eccentric harmonic index H4 (Υ R ) of Υ R , we get φ(eu , ev ) = 2

eu + ev ,
therefore φ(2, 2) = 12 , φ(2, 3) = 52 and φ(3, 3) = 13 . Thus,

p2 q + pq2 − 4pq + 2
 
φ(2, 2)
H4 (Υ R ) = φ(2, 2) + pq( p − 1)(q − 1) + 2φ(2, 3) + φ(3, 3)
2 2
p2 q + pq2 − 4pq + 2 83
= + pq( p − 1)(q − 1).
4 60

6. Conclusions
This article emphasizes the computation of first Zagreb eccentricity index, third Zagreb eccentricity
index, geometric-arithmetic eccentricity index, atom-bond connectivity eccentricity index and the
fourth type of eccentric harmonic index for zero divisor graphs associated with algebraic structures
that are commutative rings Z p1 p2 × Zq2 and Z p2 × Zq2 . This study will be useful for the further
comprehension of the attributes of various physical structures like carbohydrates, silicone structures,
polymers, hexagonal chains and cylindrical fullerenes. Likewise, they can be used for creating a
productive physical structure in mechanics as well as for different computer network problems.

Author Contributions: A.N.A.K. contribute for Conceptualization, Data curation, Funding acquisition,
Project administration and Resources. A.A. contribute for Investigation, Methodology, Supervision, and Validation.
A.H. contribute for Formal analysis, Project administration, and Visualization. All authors read and approved the
initial and final version of the paper.
Funding: This research received no external funding.
Conflicts of Interest: The authors declare no conflict of interest.

References
1. Ahmad, A.; Haider, A. Computing the radio labeling associated with zero divisor graph of a commutative
ring. UPB Sci. Bull. Ser. A 2019, 81, 65–72.
2. Beck, I. Coloring of a commutative ring. J. Algebra 1988, 116, 208–226. [CrossRef]
Symmetry 2019, 11, 907 11 of 11

3. Bac̆a, M.; Horvràthovà, J.; Mokrišovà, M.; Suhànyiovà, A. On topological indices of fullerenes. Appl. Math.
Comput. 2015, 251, 154–161.
4. Gutman, I.; Polansky, O.E. Mathematical Concepts in Organic Chemistry; Springer-Verlag: New York, NY, USA, 1986.
5. Ahmad, A. On the degree based topological indices of benzene ring embedded in P-type-surface in 2D
network. Hacet. J. Math. Stat. 2018, 47, 9–18. [CrossRef]
6. Ahmad, A. Computation of certain topological properties of honeycomb networks and Graphene.
Discret. Math. Algorithms Appl. (DMAA) 2017, 9, 1750064. [CrossRef]
7. Akhter, S.; Gao, W.; Imran, M.; Farahani, M.R. On topological indices of honeycomb networks and
graphene networks. Hacet. J. Math. Stat. 2018, 47, 19–35. [CrossRef]
8. Nadeem, M.F.; Zafar, S.; Zahid, Z. On topological properties of the line graphs of subdivision graphs of
certain nanostructures. Appl. Math. Comput. 2016, 273, 125–130. [CrossRef]
9. Wang, S.; Farahani, M.R.; Kanna, M.R.R.; Jamil, M.K.; Kumar, R.P. The Wiener Index and the Hosoya
Polynomial of the Jahangir Graphs. Appl. Comput. Math. 2016, 5, 138–141. [CrossRef]
10. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [CrossRef]
[PubMed]
11. Ghorbani, M.; Hosseinzadeh, M.A. A new version of Zagreb indices. Filomat 2012, 26, 93–100. [CrossRef]
12. Vukičević, D.; Graovac, A. Note on the comparison of the first and second normalized Zagreb
eccentricity indices. Acta Chim. Slov. 2010, 57, 524–528. [PubMed]
13. Ghorbani, M.; Khaki, A. A note on the fourth version of geometric-arithmetic index. Optoelectron. Adv. Mater.
Rapid Commum. 2010, 4, 2212–2215.
14. Farahani, M.R. Eccentricity version of atom bond connectivity index of benzenoid family ABC5 (Hk).
World Appl. Sci. J. Chem. 2013, 21, 1260–1265.
15. Farahani, M.R.; Ediz, S.; Imran, M. On novel harmonic indices of certain nanotubes. Int. J. Adv. Biotechnol. Res.
2017, 8, 277–282.
16. Gao, Y.; Ediz, S.; Farahani, M.R.; Imran, M. On the Second Harmonic Index of Titania Nanotubes. Drug Des.
Int. Prop. Int. J. 2018, 1, 7–10.
17. Estrada, E.; Torres, L.; Rodriguez, L.; Gutman, I. An atom-bond connectivity index: modelling the enthalpy
of formation of alkanes. Indian J. Chem. 1998, 37A, 849–855.
18. Siddiqui, M.K.; Naeem, M.; Rehman, N.A.; Imran, M. Computing topological indices of certain networks.
J. Optoelectron. Adv. Mater. 2016, 18, 884–892.
19. Shao, Z.; Wu, P.; Gao, Y.; Gutman, I.; Zhang, X. On the maximum ABC index of graphs without
pendent vertices. Appl. Math. Comput. 2017, 315, 298–312. [CrossRef]
20. Siddiqui, M.K.; Imran, M.; Ahmad, A. On Zagreb indices, Zagreb polynomials of some nanostar dendrimers.
Appl. Math. Comput. 2016, 280, 132–139. [CrossRef]
21. Shao, Z.; Siddiqui, M.K.; Muhammad, M.H. Computing zagreb indices and zagreb polynomials for
symmetrical nanotubes. Symmetry 2018, 10, 244. [CrossRef]
22. Gupta, S.; Singh, M.; Madan, A.K. Application of Graph Theory: Relationship of Eccentric Connectivity Index
and Wiener’s Index with Anti-inflammatory Activity. J. Math. Anal. Appl. 2002, 266, 259–268. [CrossRef]
23. Elahi, K.; Ahmad, A.; Hasni, R. Construction algorithm for zero divisor graphs of finite commutative rings
and their vertex-based eccentric topological indices. Mathematics 2018, 6, 301. [CrossRef]
24. Imran, M.; Siddiqui, M.K.; Abunamous, A.A.E.; Adi, D.; Rafique, S.H.; Baig, A.Q. Eccentricity based
topological indices of an oxide network. Mathematics 2018, 6, 126. [CrossRef]
25. Harris, J.M.; Hirst, J.L.; Mossinghoff, M.J. Combinatorics and Graph Theory; Springer Science and
Business Media: Berlin, Germany, 2008.
26. Anderson, D.F.; Livingston, P.S. The Zero-divisor Graph of Commutative Ring. J. Algebra 1999, 217, 434–447. [CrossRef]
27. Akbari, S.; Mohammadian, A. On the zero-divisor graph of a commutative ring. J. Algebra 2004, 274, 847–855.
[CrossRef]
28. Anderson, D.F.; Mulay, S.B. On the diameter and girth of a zero-divisor graph. J. Pure Appl. Algebra 2008,
210, 543–550. [CrossRef]

c 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license (http://creativecommons.org/licenses/by/4.0/).