mathematics

Article
Construction Algorithm for Zero Divisor Graphs of
Finite Commutative Rings and Their Vertex-Based
Eccentric Topological Indices
Kashif Elahi 1,2, *, Ali Ahmad 3, * and Roslan Hasni 2, *
1 Deanship of E-learning and Information Technology, Jazan University, Jazan 45142, Saudi Arabia
2 Department of Mathematics, University Malaysia Terengganu, Kuala Terengganu 21030,
Terengganu, Malaysia
3 College of Computer Science and Information Technology, Jazan University, Jazan 45142, Saudi Arabia
* Correspondence: [email protected] (K.E.); [email protected] (A.A.);
[email protected] (R.H.)




Received: 26 October 2018; Accepted: 2 December 2018; Published: 4 December 2018


Abstract: Chemical graph theory is a branch of mathematical chemistry which deals with the
non-trivial applications of graph theory to solve molecular problems. Graphs containing finite
commutative rings also have wide applications in robotics, information and communication theory,
elliptic curve cryptography, physics, and statistics. In this paper we discuss eccentric topological
indices of zero divisor graphs of commutative rings Z p1 p2 × Zq , where p1 , p2 , and q are primes.
To enhance the importance of these indices a construction algorithm is also devised for zero divisor
graphs of commutative rings Z p1 p2 × Zq .

Keywords: topological index; zero divisor graphs; commutative ring

MSC: 05C12; 05CO5; 05C90

1. Introduction
A single number that can be utilized to depict properties of the graph of a molecule is known as
a topological descriptor for that graph. There are different topological descriptors that have found
a number of applications in theoretical science. Topological descriptors are numerical parameters
of a graph that characterize its topology and are usually graph-invariant. Topological descriptors
are utilized within the improvement of quantitative structure-activity connections (QSARs) and
quantitative structure-property connections (QSPR) in which the organic movement or other properties
of atoms are connected with their chemical structure. Topological descriptors are utilized in
QSPR/QSAR. These days, there exists a variety of topological descriptors that have some applications
in chemistry, physics, robotics, statistics, and computer networks. The topological descriptors deal with
the distance among the vertices in a graph are “distance-based topological indices”. Other topological
descriptors that deal with the degree of vertices in graph are “degree-based topological indices”.
The Wiener index is the first distance based topological index and it has eminent applications in
chemistry. Wiener index is based on topological distance of vertices within the individual graph,
the Hosoya index is calculated by checking of non-incident edges in a graph, the energy and the
Estrada index are based on the range of the graph, the Randic connectivity index is calculated utilizing
the degrees of vertices. For further detail about other indices [1–9] can be explored.

Mathematics 2018, 6, 301; doi:10.3390/math6120301 www.mdpi.com/journal/mathematics

Mathematics 2018, 6, 301 2 of 9

2. Definitions and Notations

Let G be a connected graph with vertex and edge sets V ( G ) and E( G ), respectively. A numerical
quantity related to a graph that is invariant under graph automorphisms is topological index or
topological descriptor. For a graph G, the degree of a vertex v is the number of edges incident with
v and denoted by d(v). The maximum degree of a graph G, denoted by ∆( G ), and the minimum
degree of a graph, denoted by δ( G ), are the maximum and minimum degree of its vertices. The sum of
degree of all vertices u which are adjacent to vertex v is denoted by S(v). The distance between the
vertices u and v of G is denoted by d(u, v) and it is defined as the number of edges in a minimal path
connecting them.
Connectivity descriptors are important among topological descriptors and used in various fields
like chemistry, physics, and statistics. Let x1 , x2 ∈ V ( G ), the distance d( x1 , x2 ) between x1 and x2 ,
be defined as the length of any shortest path in G connecting x1 and x2 . In mathematical, eccentricity
is defined as:
e(u) = max {d(u, v) : ∀ v ∈ V ( G )} (1)

In 1997 eccentric connectivity index was introduced by Sharma [10]. By using eccentric
connectivity index, the mathematical modeling of biological activities of diverse nature is done.
The general formula of eccentric connectivity index is defined as:

ξ (G) = ∑ dv e(v) (2)

v ∈V

where e(v) is the eccentricity of vertex v in G. Some applications and mathematical properties of
eccentric connectivity index can be found in [11–14]. The total eccentricity index is the sum of
eccentricity of the all the vertex v in G. Total eccentricity index is introduced by Farooq and Malik [15],
which is defined as:
ζ ( G ) = ∑ e(v) (3)
v ∈V

The first Zagreb index of a graph G is studied in [16] based on degree and the new version of
the first Zagreb index based on eccentricity was introduced by Ghorbani and Hosseinzadeh [17],
as follows:
The eccentric connectivity polynomial is the polynomial version of the eccentric-connectivity
index which was proposed by Alaeiyan, Mojarad, and Asadpour [18] and some graph operations can
be found in [19]. The eccentric connectivity polynomial of a graph G is defined as:

ECP( G, x ) = ∑ d ( v ) x e(v) (4)

v ∈V

Gupta, Singh and Madan [20] defined the augmented eccentric connectivity index of a graph G
as follows:

M(v)
ξ ac ( G ) = ∑ e(v)
(5)
v ∈V

where M (v) denotes the product of degrees of all vertices u which are adjacent to vertex v.
Some interesting results on augmented eccentric connectivity index are discussed in [21,22].
Another very relevant and special eccentricity based topological index is connective eccentric index.
The connective eccentric index was defined by Gupta, Singh, and Madan [20] defined as follows:

d(v)
ξ C (G) = ∑ e(v)
(6)
v ∈V
Mathematics 2018, 6, 301 3 of 9

Ediz [23,24] introduced the Ediz eccentric connectivity index and reverse eccentric connectivity
index of graph G, which is used in various branches of sciences, molecular science, and chemistry etc.
The Ediz eccentric connectivity index and reverse eccentric connectivity index are defined as:

S(v)
Eζ ( G ) = ∑ e(v)
(7)
v ∈V ( G )

e(v)
Re
ζ (G) = ∑ S(v)
(8)
v ∈V ( G )

where S(v) is the sum of degrees of all vertices, u, adjacent to vertex v, e(v) is the eccentricity of v.
Let R be a commutative ring with identity and Z ( R) is the set of all zero divisors of R. G ( R) is
said to be a zero divisor graph if x, y ∈ V ( G ( R)) = Z ( R) and ( x, y) ∈ E( G ( R)) if and only if x.y = 0.
Beck [25] introduced the notion of zero divisor graph. Anderson and Livingston [26] proved that G ( R)
is always connected if R is commutative. Anderson and Badawi [27] introduced the total graph of R as:
There is an edge between any two distinct vertices u, v ∈ R if and only if u + v ∈ Z ( R). For a graph G,
the concept of graph parameters have always a high interest. Numerous authors briefly studied the
zero-divisor and total graphs from commutative rings [28–32]. Similar problems were investigated
in [33,34].
Let p1 , p2 , and q be prime numbers, with p2 > p1 and Γ(Z p1 p2 × Zq ) being zero divisor graph of
the commutative rings Z p1 p2 × Zq . In this paper, we investigate the eccentric topological descriptors
namely, eccentric connectivity index, total eccentric index, first Zagreb eccentricity index, connective
eccentric index, Ediz eccentric index, eccentric connectivity polynomial, and augmented eccentric
connectivity index of zero divisor graphs Γ(Z p1 p2 × Zq ). Now onward, we use G as a zero divisor
graph of the commutative rings Z p1 p2 × Zq .

3. Methods
In this paper, we adopted interdisciplinary methods by combining algorithmic approach
for graph construction and outcome of algorithm are aligned with eccentric topological
indices. For prime numbers p1 , p2 , q with p2 > p1 , we consider the commutative ring
R = Z p1 p2 × Zq with usual addition and multiplication. The zero divisor graph G = Γ(Z p1 p2 × Zq )
associated with ring R is defined as: For a ∈ Z p1 p2 , b ∈ Zq , ( a, b) 6∈ V ( G ) if and
only if a 6= kp1 , a 6= sp2 for k = 1, 2, · · · , p2 − 1, s = 1, 2, · · · , p1 − 1 and y 6= 0.
Let J = {( a, b) 6∈ V ( G ) : a 6= kp1 , a 6= sp2 , k = 1, 2, · · · , p2 − 1, s = 1, 2, · · · , p1 − 1 & y 6= 0},
then | J | = ( p1 p2 − p1 − p2 + 1)(q − 1). The elements of the set J are the non zero divisors of R.
Also (0, 0) ∈ Z p1 p2 × Zq is a non zero divisor. Therefore, | J | + 1 = ( p1 p2 − p1 − p2 + 1)(q − 1) + 1 are
the total number of non zero divisors of R and the total number of elements of R are p1 p2 q. Hence,
p1 p2 q − ( p1 p2 − p1 − p2 + 1)(q − 1) + 1 = ( p1 + p2 − 1)(q − 1) + p1 p2 − 1 are the total number of
zero divisors. This implies that |V ( G )| = ( p1 + p2 − 1)(q − 1) + p1 p2 − 1. We can construct the zero
divisor graph of commutative ring R = Z p1 p2 × Zq by the following algorithm:

Input: p1 , p2 and q are three prime numbers.

Output: ordered pairs for zero divisor.
Mathematics 2018, 6, 301 4 of 9

Algorithm 1 ZeroDivisorGraph( p1 , p2 , q)
1: if ( p1 < p2)
2:
3: for x1 ← 0 to p1 × p2
4:
5: for y1 ← 0 to q
6:
7: if ( x1 6= 0 OR y1 6= 0)
8:
9: createGraph( x1 , y1 , p1 , p2 , q)

Algorithm 2 createGraph (x1 , y1 , p1 , p2 , q)

1: for x2 ← x1 to p1 × p2
2:
3: for y2 ← y1 to q
4:
5: if ( x1 6= x2 AND y1 6= y2)
6:
7: if ( x1 6= 0 OR y1 6= 0)
8:
9: k1 = 0
10:
11: else
12:
13: k1 = x1 × x2
14:
15: if (y1 6= 0 OR y2 6= 0)
16:
17: k2 = 0
18:
19: else
20:
21: k2 = y1 × y2
22:
23: if (k1 mod p1 = 0 AND k1 mod p2 = 0 AND k2 = 0)
24:
25: return x1 , y1 , x1 , y2

Outcomes of above algorithm, the degree of each vertex ( a, b) ∈ V ( G ) can be depicted

mathematically in the following cases:
Case 1: If a = 0 and any b ∈ Zq \ {0}, then each such type of vertex (0, b) is adjacent to the
vertices ( a0 , 0) for every a0 ∈ Z p1 p2 \ {0}. Hence the degree of each vertex (0, b) is p1 p2 − 1.
Case 2: If a = kp1 , k = 1, 2, · · · , p2 − 1 and b = 0, then each such type of vertex ( a, 0) is adjacent
to the vertices (0, b), ( a0 , 0) & ( a0 , b0 ) for every b0 = {1, 2, · · · , q − 1}, and a0 = sp2 , s = 1, 2, · · · , p1 − 1.
Hence the degree of each vertex ( a, 0) is q − 1 + p1 − 1 + ( p1 − 1)(q − 1) = p1 q − 1. Similarly, if a =
sp2 , s = 1, 2, · · · , p1 − 1 and b = 0, then the degree of each such type of vertices ( a, 0) is p2 q − 1.
Case 3: If a ∈ Z p1 p2 \ {0, kp1 , sp2 with k = 1, 2, · · · , p2 − 1, s = 1, 2, · · · , p1 − 1} and b = 0,
then each such type of vertex ( a, 0) is adjacent with only (0, b0 ) for every b0 ∈ Zq \ {0}. Hence the
degree of each vertex ( a, 0) is q − 1.
Case 4: If a = kp1 , k = 1, 2, · · · , p2 − 1 and b ∈ Zq \ {0}, then each such type of vertex ( a, b) is
adjacent with only ( a0 , 0) for every a0 = sp2 , s = 1, 2, · · · , p1 − 1 . Therefore, the degree of each vertex
( a, b) is p1 − 1. Similarly, if a = sp2 , s = 1, 2, · · · , p1 − 1 and b ∈ Zq \ {0}, then degree of each such
type of vertices ( a, b) is p2 − 1.
From the above discussion and our convenance, let us partitioned the vertex set of G based one
their degrees as follows:

V1 ={(0, x ) : x ∈ Zq , x 6= 0}
V2 ={( x, 0) : x = kp1 , k = 1, 2, . . . , p2 − 1}
V3 ={( x, 0) : x = sp2 , s = 1, 2, . . . , p1 − 1}
V4 ={( x, 0) : x ∈ Z p1 p2 \ {0}, x 6= kp1 , x 6= sp1 , k = 1, 2, . . . , p2 − 1, s = 1, 2, . . . , p1 − 1}
V5 ={( x, y) : x = kp1 , k = 1, 2, . . . , p2 − 1, y ∈ Zq \ {0}}
V6 ={( x, y) : x = sp2 , s = 1, 2, . . . , p1 − 1, y ∈ Zq \ {0}}
Mathematics 2018, 6, 301 5 of 9

This shows that V ( G ) = V1 ∪ V2 ∪ V3 ∪ V4 ∪ V5 ∪ V6 . It is easy to see that |V1 | = q − 1, |V2 | = p2 − 1,

|V3 | = p1 − 1, |V4 | = ( p1 − 1)( p2 − 1), |V5 | = ( p2 − 1)(q − 1), and |V1 | = ( p1 − 1)(q − 1).

4. Main Results
Let dU (u) denote the degree of a vertex u in U and d(U, V ) denotes the distance between the
vertices of two sets U and V. In the following theorem, we determined the eccentricity of the vertices
of G.

Theorem 1. Let G be the zero divisor graph of the commutative ring R, then the eccentricity of the vertices of
G is 2 or 3.

Proof. From case 1, the vertices of the set V1 are at distance 1 with the vertices of the sets V2 , V3 , & V4
i.e., d(V1 , V2 ) = d(V1 , V3 ) = d(V1 , V4 ) = 1. From Case 4, the vertices of the sets V2 and V3 are adjacent
with the vertices of the sets V6 and V5 , respectively. This implies that d(V1 , V5 ) = d(V1 , V6 ) = 2.
The distance between any two different vertices of the set V1 is also 2. Therefore the eccentricity of the
vertices of set V1 is 2, i.e., e(V1 ) = 2. Similarly, it is easy to see that e(V2 ) = e(V3 ) = 2.
As d(V1 , V2 ) = d(V1 , V3 ) = d(V1 , V4 ) = 1 and d(V1 , V5 ) = d(V1 , V6 ) = 2. This implies that
d(V4 , V5 ) = d(V4 , V1 ) + d(V1 , V5 ) = 3. This shows that e(V4 ) = 3. Similarly, it is easy to calculate that
e(V5 ) = e(V6 ) = 3. This completes the proof.

Summarizing the above cases, partition of vertices and their cardinality and Theorem 1 in Table 1.

Table 1. The representation of vertices, their degree, eccentricity, and frequency of the vertices in G.
Representatives of Vertices Degree Eccentricity Frequency
V1 p1 p2 − 1 2 q−1
V2 p1 q − 1 2 p2 − 1
V3 p2 q − 1 2 p1 − 1
V4 q−1 3 ( p1 − 1)( p2 − 1)
V5 p1 − 1 3 ( p2 − 1)(q − 1)
V6 p2 − 1 3 ( p1 − 1)(q − 1)

In the following theorem, we determined the eccentric connectivity index of the graph G.

Theorem 2. Let p1 < p2 , q be prime numbers, then eccentric connectivity index of graph G is ξ ( G ) =
p1 p2 (15q − 11) − ( p1 + p2 )(11q − 7) + 7q − 3.

Proof. By using the degree of each vertex partition and corresponding their eccentricity from Table 1
in the Equation (2), we obtain:

ξ (G) = ∑ dv e(v)
v ∈V
=2( p1 p2 − 1)(q − 1) + 2( p1 q − 1)( p2 − 1) + 2( p2 q − 1)( p1 − 1)
+3( p1 − 1)( p2 − 1)(q − 1) + 3( p1 − 1)( p2 − 1)(q − 1) + 3( p1 − 1)( p2 − 1)(q − 1)

After simplification, we get:

ξ ( G ) = p1 p2 (15q − 11) − ( p1 + p2 )(11q − 7) + 7q − 3.
This completes the proof.

The eccentricity of the vertices and their frequency is given in the Table 1 of the graph G, by putting
these values and after simplification we obtain the following two corollaries.

Corollary 1. Let p1 < p2 , q be prime numbers, then the total-eccentricity index of G is given by
ζ ( G ) = 3( p1 p2 + p1 q + p2 q + 1) − 4( p1 + p2 + q ).
Mathematics 2018, 6, 301 6 of 9

Corollary 2. Let p1 < p2 , q be prime numbers, then the first Zagreb eccentricity index of G is given by
M1 ∗ ( G ) = 9( p1 p2 + p1 q + p2 q) − 14( p1 + p2 + q) + 15.

Theorem 3. Let p1 < p2 , q be prime numbers, then the connective eccentric index of graph G is ξ C ( G ) =
( p1 − 1)( p2 − 1)(q − 1) + 2 + p1 p2 (3q−1)−( p21 + p2 +1)(q+1) .

Proof. By using the values of degrees and their eccentricity in the Equation (6), we obtain the following:

d(v)
ξ C (G) = ∑ e(v)
v ∈V
( p p − 1)(q − 1) ( p1 q − 1)( p2 − 1) ( p2 q − 1)( p1 − 1)
= 1 2 + +
2 2 2
( p1 − 1)( p2 − 1)(q − 1) ( p1 − 1)( p2 − 1)(q − 1)
+ +
3 3
( p1 − 1)( p2 − 1)(q − 1)
+
3
p p (3q − 1) − ( p1 + p2 + 1)(q + 1)
=( p1 − 1)( p2 − 1)(q − 1) + 2 + 1 2 .
2
After simplification, we get
p1 p2 (3q−1)−( p1 + p2 +1)(q+1)
ξ C ( G ) = ( p1 − 1)( p2 − 1)(q − 1) + 2 + 2 .
This completes the proof.

Theorem 4. Let p1 < p2 , q be prime numbers, then the Ediz eccentric connectivity index of graph G is
9( p1 −1)( p2 −1)(q−1)+8[( p1 −1)( p2 q−1)+( p2 −1)( p1 q−1)+( p1 p2 −1)(q−1)]
Eζ ( G ) = 6 .

Proof. S(v) is the sum of degrees of all vertices u which are adjacent to vertex v. Calculate the values
of S(v) with the help of Table 1. The eccentricity of each vertex is also given in Table 1. Putting these
vales in Equation (7), we obtain the following:

S(v)
Eζ ( G ) = ∑ e(v)
v ∈V ( G )
( p1 − 1)( p2 − 1)(q − 1) + ( p1 − 1)( p2 q − 1) + ( p2 − 1)( p1 q − 1)
=
2
( p1 − 1)( p2 − 1)(q − 1) + ( p1 − 1)( p2 q − 1) + (q − 1)( p1 p2 − 1)
+
2
( p1 − 1)( p2 − 1)(q − 1) + ( p2 − 1)( p1 q − 1) + (q − 1)( p1 p2 − 1)
+
2
(q − 1)( p1 p2 − 1) ( p1 − 1)( p2 q − 1) ( p2 − 1)( p1 q − 1)
+ + +
3 3 3

After simplification, we get

9( p1 −1)( p2 −1)(q−1)+8[( p1 −1)( p2 q−1)+( p2 −1)( p1 q−1)+( p1 p2 −1)(q−1)]
Eζ ( G ) = 6 .
This completes the proof.

Theorem 5. Let p1 < p2 , q be prime numbers, then the eccentric connectivity polynomial of graph G is
ECP( G, x ) = (3p1 p2 q − p1 p2 − p1 q − p1 − p2 q − p2 − q + 3) x2 + 3( p1 − 1)( p2 − 1)(q − 1) x3 .

Proof. By using the degree of each vertex partition and their corresponding eccentricities from Table 1
Equation (4), we obtain:
Mathematics 2018, 6, 301 7 of 9

ECP( G, x ) = ∑ d ( v ) x e(v)
v ∈V
=( p1 p2 − 1)(q − 1) x2 + ( p1 q − 1)( p2 − 1) x2
+( p2 q − 1)( p1 − 1) x2 + ( p1 − 1)( p2 − 1)(q − 1) x3
+( p1 − 1)( p2 − 1)(q − 1) x3 + ( p1 − 1)( p2 − 1)(q − 1) x3
=(3p1 p2 q − p1 p2 − p1 q − p1 − p2 q − p2 − q + 3) x2
+3( p1 − 1)( p2 − 1)(q − 1) x3 .

After simplification, we get

ECP( G, x ) = (3p1 p2 q − p1 p2 − p1 q − p1 − p2 q − p2 − q + 3) x2 + 3( p1 − 1)( p2 − 1)(q − 1) x3 .
This completes the proof.

Theorem 6. Let p1 < p2 , q be prime numbers, then augmented eccentric connectivity index
( p1 −1)( p2 −1)( p1 p2 −1)q−1 +( p1 −1)(q−1)( p1 q−1) p2 −1 +( p2 −1)(q−1)( p2 q−1) p1 −1
of graph G is ξ ac ( G ) = 3 +
( p1 −1) p2 q−q− p2 +2 ( p1 q−1) p2 −1 ( p1 p2 −1)q−1 +( p2 −1) p1 q− p1 −q+2 ( p1 p2 −1)q−1 ( p2 q−1) p1 −1
2 +
( q −1 ) p1 p2 − p1 − p2 +2 ( p 1 q −1 ) p2 −1 ( p 2 q −1 ) p1 −1
2 .

Proof. M (v) is the product of degrees of all vertices u which are adjacent to vertex v. Calculate the
values of M(v) with the help of Table 1. The eccentricity of each vertex is also given in the Table 1.
Putting these vales in Equation (5), we obtain the following:

M(v)
ξ ac ( G ) = ∑ e(v)
v ∈V
( p − 1)( p2 − 1)( p1 p2 − 1)q−1 ( p1 − 1)(q − 1)( p1 q − 1) p2 −1
= 1 +
3 3
( p2 − 1)(q − 1)( p2 q − 1) p1 −1
++
3
( p − 1)( p1 − 1) p1 −1)(q−1) ( p1 q − 1) p2 −1 ( p1 p2 − 1)q−1
(
+ 1
2
( p2 − 1)( p2 − 1)( p2 −1)(q−1) ( p1 p2 − 1)q−1 ( p2 q − 1) p1 −1
+
2
(q − 1)(q − 1)( p1 −1)( p2 −1) ( p1 q − 1) p2 −1 ( p2 q − 1) p1 −1
+
2
After simplification, we get
( p1 −1)( p2 −1)( p1 p2 −1)q−1 +( p1 −1)(q−1)( p1 q−1) p2 −1 +( p2 −1)(q−1)( p2 q−1) p1 −1
ξ ac ( G ) = 3 +
( p1 −1) p2 q−q− p2 +2 ( p1 q−1) p2 −1 ( p1 p2 −1)q−1 +( p2 −1) p1 q− p1 −q+2 ( p1 p2 −1)q−1 ( p2 q−1) p1 −1
2 +
( q −1 ) p1 p2 − p1 − p2 +2 ( p 1 q −1 ) p2 −1 ( p 2 q −1 ) p1 −1
2
This completes the proof.

If p1 , p2 and q are prime numbers with p1 = p2 = p, then Ahmad et al. [35] determined the
vertex-based eccentric topological indices of zero divisor graph of the commutative ring Z p2 × Zq
as follows:

Theorem 7 ([35]). Let p, q be prime numbers. If G ( R) is the zero divisor graph of the commutative ring
R = Z p2 × Zq , then
• ξ ( G ( R)) = 10p2 q − 8p2 − 11pq + 5p + q + 3.
Mathematics 2018, 6, 301 8 of 9

• ζ ( G ( R)) = 3p2 + 3pq − 4p − q − 1

• M1 ∗ ( G ( R)) = 9p2 + 9pq − 14p − 5q + 1.
( p−1)(10pq−7p+q−7)
• ξ C (G) = 6
2−p
p −1 ( q −1) p p( p−1)(q−1) ( pq−2) p−2
• ξ ac ( G ( R)) = ( 3 + 2 )( pq − 2) p−1 (q − 1) + ( 3p + 2 )( p2 − 1 ) q −1 ( p − 1 ).

5. Conclusions
In this paper, we discussed the vertex-based eccentric topological indices, namely eccentric
connectivity index, total-eccentricity index, first Zabreb eccentricity index, connective eccentric index,
Ediz eccentric connectivity index, eccentric connectivity polynomial, and augmented eccentric index for
zero divisor graphs of commutative rings Z p1 p2 × Zq where p1 , p2 and q are primes. These indices are
helpful in understanding the characteristics of different physical structures like carbon nanostructures,
hexagonal belts and chains, Fullerence and Nanocone, structure-boiling point, and the relationships of
various alkanes. They can be used in estimating and trouble shooting computer network problems
regarding distance, speed, and time. They can also be helpful in developing efficient physical structure
in robotics.

Author Contributions: R.H. contribute for supervision and analyzed the data curation. A.A. contribute for
Investigation, visualization, validation, computation and Methodology. K.E. contribute for conceptualization,
validation, designing the experiments, resources, software and wrote the initial draft of the paper. All authors
read and approved the final version of the paper.
Funding: This research received no external funding.
Acknowledgments: The authors are grateful to the reviewers for suggestions to improve the presentation of
the manuscript.
Conflicts of Interest: The authors declare no conflict of interest.

References
1. 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.
2. Bac̆a, M.; Horvràthovà, J.; Mokrišovà, M.; Suhànyiovà, A. On topological indices of fullerenes. Appl. Math.
Comput. 2015, 251, 154–161.
3. Baig, A.Q.; Imran, M.; Ali, H.; Rehman, S.U. Computing topological polynomial of certain nanostructures.
J. Optoelectron. Adv. Mater. 2015, 17, 877–883.
4. Estrada, E. Atom-Bond Connectivity and the Energetic of Branched Alkanes. Chem. Phys. Lett. 2008, 463,
422–425.
5. 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.
6. Gravovac, A.; Ghorbani, M.; Hosseinzadeh, M.A. Computing fifth geometric-arithmatic index ABC4 index
of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2010, 4, 1419–1422.
7. Hayat, S.; Imran, M. Computation of topological indices of certain networks. Appl. Math. Comput. 2014, 240,
213–228.
8. Nadeem, M.F.; Zafar, S.; Zahid, Z. On certain topological indices of the line graph of subdivision graphs.
Appl. Math. Comput. 2015, 271, 790–794.
9. 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.
10. Sharma, V.; Goswami, R.; Madan, A.K. Eccentric connectivity index: A novel highly discriminating
topological descriptor for structure property and structure activity studies. J. Chem. Inf. Comput. Sci.
1997, 37, 273–282.
11. Dureja, H.; Madan, A.K. Topochemical models for prediction of cyclin-dependent kinase 2 inhibitory activity
of indole-2-ones. J. Mol. Model. 2005, 11, 525–531.
12. Ilic, A.; Gutman, I. Eccentric-connectivity index of chemical trees. MATCH Commun. Math. Comput. Chem.
2011, 65, 731–744.
Mathematics 2018, 6, 301 9 of 9

13. Kumar, N.; Madan, A.K. Application of graph theory: Prediction of cytosolic phospholipase A(2) inhibitory
activity of propan-2-ones. J. Math. Chem. 2006, 39, 511–521.
14. Zhou, B. On eccentric-connectivity index. MATCH Commun. Math. Comput. Chem. 2010, 63, 181–198.
15. Farooq, R.; Malik, M.A. On some eccentricity based topological indices of nanostar dendrimers. Optoelectron.
Adv. Mater. Rapid Commun. 2015, 9, 842–849.
16. Li, X.; Zhao, H. Trees with the first three smallest and largest generalized topological indices. MATCH
Commun. Math. Comput. Chem. 2004, 50, 57–62.
17. Ghorbani, M.; Hosseinzadeh, M.A. A new version of Zagreb indices. Filomat 2012, 26, 93–100.
18. Alaeiyan, M.; Asadpour, J.; Mojarad, R. A numerical method for MEC polynomial and MEC index of one
pentagonal carbon nanocones. Fuller. Nanotub. Carbon Nanostruct. 2013, 21, 825–835.
19. Ashrafi, A.R.; Ghorbani, M.; Hossein-Zadeh, M.A. The eccentric-connectivity polynomial of some graph
operations. Serdica J. Comput. 2011, 5, 101–116.
20. Gupta, S.; Singh, M.; Madan, A.K. Connective eccentricity index: A novel topological descriptor for
predicting biological activity. J. Mol. Graph. Model. 2000, 18, 18–25.
21. De, N. Relationship between augmented eccentric-connectivity index and some other graph invariants. Int.
J. Adv. Math. 2013, 1, 26–32.
22. Doślić, T.; Saheli, M. Augmented eccentric-connectivity index. Miskolc Math. Notes 2011, 12, 149–157.
23. Ediz, S. On the Ediz eccentric connectivity index of a graph. Optoelectron. Adv. Mater. Rapid Commun. 2011, 5,
1263–1264.
24. Ediz, S. Reverse eccentric connectivity index. Optoelectron. Adv. Mater. Rapid Commun. 2012, 6, 664–667.
25. Beck, I. Coloring of a commutative ring. J. Algebra 1988, 116, 208–226.
26. Anderson, D.F.; Livingston, P.S. The Zero-divisor Graph of Commutative Ring. J. Algebra 1999, 217, 434–447.
27. Anderson, D.F.; Badawi, A. On the Zero-Divisor Graph of a Ring. Commun. Algebra 2008, 36, 3073–3092.
28. Akbari, S.; Mohammadian, A. On the zero-divisor graph of a commutative ring. J. Algebra 2004, 274, 847–855.
29. Anderson, D.F.; Mulay, S.B. On the diameter and girth of a zero-divisor graph. J. Pure Appl. Algebra 2008,
210, 543–550.
30. Asir, T.; Tamizh Chelvam, T. On the total graph and its complement of a commutative ring. Commun. Algebra
2013, 41, 3820–3835.
31. Samei, K. The zero-divisor graph of a reduced ring. J. Pure Appl. Algebra 2007, 209, 813–821.
32. Tamizh Chelvam, T.; Asir, T. A note on total graph of Zn . J. Discret. Math. Sci. Cryptogr. 2011, 14, 1–7.
33. Belov, A.Y. Linear Recurrence Equations on a Tree. Math. Notes 2005, 78, 603–609.
34. Belov, A.Y.; Borisenko, V.V.; Latyshev, V.N. Monomial algebras. J. Math. Sci. 1997, 87, 3463–3575.
35. Ahmad, A.; Bac̆a, M.; Semaničová–Feňovčíková, A. Computation of vertex based eccentric topological
indices of zero divisor graph of Z p2 × Zq . 2018, submitted.

c 2018 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/).