Next Article in Journal
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
Previous Article in Journal
Set Evincing the Ranks with Respect to an Embedded Variety (Symmetric Tensor Rank and Tensor Rank
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Eccentricity-Based Topological Indices of a Cyclic Octahedron Structure

1
Department of Mathematics, COMSATS University Islamabad, Sahiwal 57000, Pakistan
2
Department of Mathematics, The University of Lahore, Pakpattan Campus, Pakpattan 57400, Pakistan
3
Department of Mathematics, Govt. High School Burhan, Attock 43600, Pakistan
*
Author to whom correspondence should be addressed.
Mathematics 2018, 6(8), 141; https://doi.org/10.3390/math6080141
Submission received: 10 July 2018 / Revised: 7 August 2018 / Accepted: 9 August 2018 / Published: 17 August 2018

Abstract

:
In this article, we study the chemical graph of a cyclic octahedron structure of dimension n and compute the eccentric connectivity polynomial, the eccentric connectivity index, the total eccentricity, the average eccentricity, the first Zagreb index, the second Zagreb index, the third Zagreb index, the atom bond connectivity index and the geometric arithmetic index of the cyclic octahedron structure. Furthermore, we give the analytically closed formulas of these indices which are helpful for studying the underlying topologies.

1. Introduction

Graph theory has advanced greatly in the field of mathematical chemistry. Chemical graph theory has become very popular among researchers because of its wide application in mathematical chemistry. The molecular topological descriptors are the numerical invariants of a molecular graph and are very useful for predicting their bioactivity. A great variety of such indices have been studied and used in theoretical chemistry, by pharmaceutical researchers, in drugs, and in other different fields. There is considerable usage of graph theory in chemistry. Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to the mathematical modeling of chemical occurrence. A lot of research has been done in this area in the last few decades. This theory has a major role in the field of chemical sciences.
In reference [1,2], W. Gao et al. computed the electron energy of molecular structures through the forgotten topological index. Also, they computed the generalized atom bond connectivity index of several chemical molecular graphs. In reference [3,4,5], the authors studied topological indices of networks and nanotubes. The topological index of aztec diamonds was discussed in reference [6] by M. Imran et al. Some degree-based and eccentricity-based topological indices of oxide networks and tetra sheets were described in reference [7,8,9] by A. Q. Baig et al., respectively.
Recently the eccentric atom bond connectivity index of linear polycene parallelogram benzenoid was introduced by reference [10]. Sierpinski graphs constitute an extensively studied family of graphs of fractal nature and have been applied in topology, the mathematics of the Tower of Hanoi, computer science, and elsewhere [11]. The Sierpinski graphs were introduced in reference [12] by Klavzar and Milutinovic. The average eccentricity and standard deviation for all Sierpiński graphs ( S p n ) was established by reference [13]. The extremal properties of the average eccentricity as well as the conjectures and autographics were obtained by reference [14], in which the AutoGraphiX(AGX) computer system was developed by the GERAD group from Montreal [15,16,17]. AGX is an interactive software designed to help find conjectures in graph theory. The bounds on the mean eccentricity of graph and also the change in mean eccentricity when a graph is replaced by a subgraph was established by reference [18]. For trees with a fixed diameter, fixed matching number and fixed number of pendent vertices, the lower and upper bounds of average eccentricity were found by reference [19].
An undirected graph is a pair ( G = ( V , E ) ), where V is the set of vertices, and E V 2 is a set of edges. In molecular graph theory, the vertices represent atoms, and the edges represent bonds between the atoms.
If u , v V , then the distance ( d ( u , v ) ) between u and v is defined as the length of any shortest path in G connecting u and v. We denote d v as the number of edges incident to vertex v in G. The eccentricity of u is the distance of vertex u from the farthest vertex in G. In mathematical form, this is shown as ε ( u ) = max { d ( u , v ) | v V } . Table 1 describes the eccentricity-based indices and polynomials which have been introduced over the years.
The aim of this paper is to compute and compare the above described eccentric-based topological indices for a cyclic octahedron structure of dimension n.

2. Main Results and Discussion

In this section, we discuss the cyclic octahedron structure and give closed formulae of certain topological indices for this network. Here, we find the analytically closed results of the eccentric connectivity polynomial, the eccentric connectivity index, the total eccentricity index, the average eccentricity index, and the eccentricity-based geometric-arithmetic and atom bond connectivity indices for the cyclic octahedron structure.
An octahedron graph, as shown in Figure 1, is a polyhedral graph corresponding to the skeleton of the octahedron, one of the five Platonic solids. This Platonic graph consists of six vertices and 12 edges. The analogs of this structure play vital roles in the field of reticular chemistry, which deals with the synthesis and properties of metal-organic frameworks [11,29].
The different types of octahedral structures arise from the ways that these octahedra can be connected. The cyclic octahedral structure of dimension n is denoted by C Y O n , and it is obtained by arranging n octahedra in cyclic order, as shown in Figure 2. For n 3 , C Y O n consists of 5 n vertices and 12 n edges. To compute the said indices and polynomials, we partitioned the vertices and edges of C Y O n in certain ways in Table 2, Table 3, Table 4, Table 5, Table 6 and Table 7. To understand the tables and the partitions that they describe, we give detailed captions of each table. We computed the exact formulas for the above mentioned topological indices of the cyclic octahedral structure as follows.

2.1. Eccentric Connectivity Polynomial

Then, using the following theorems, we computed the eccentric polynomial of the cyclic octahedron structure ( E C P ( C Y O n , x ) ).
Theorem 1.
Let C Y O n , for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the eccentric polynomial of C Y O n is
E C P ( C Y O n , x ) = 8 n { 2 x + 1 } x n + 1 2 .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the eccentric polynomial is
E C P ( G , x ) = v V d v x ε ( v ) .
Using the vertex partition from Table 1, we obtained the following computations:
E C P ( C Y O n , x ) = 4 · 4 n · ( x ) n + 3 2 + 8 · n · ( x ) n + 1 2 ,
E C P ( C Y O n , x ) = 16 n · ( x ) n + 3 2 + 8 n · ( x ) n + 1 2 ,
E C P ( C Y O n , x ) = 8 n { 2 x + 1 } x n + 1 2 .
 ☐
Theorem 2.
Let C Y O n , for all n 4 where n is even, be the cyclic octahedron structure. Then, the eccentric polynomial of C Y O n is
E C P ( C Y O n , x ) = 8 n { x + 2 } x n + 2 2 .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the eccentric polynomial is
E C P ( G , x ) = v V d v x ε ( v ) .
Using the vertex partition from Table 2, we obtained the following computations:
E C P ( C Y O n , x ) = 8 · n · ( x ) n + 2 2 + 8 · n · ( x ) n + 4 2 + 8 · n · ( x ) n + 2 2 ,
E C P ( C Y O n , x ) = 8 n · ( x ) n + 4 2 + 16 n · ( x ) n + 2 2 ,
E C P ( C Y O n , x ) = 8 n { x + 2 } x n + 2 2 .
 ☐

2.2. Eccentric Connectivity Index

Then, using the following theorems, we computed the eccentric connectivity index of the cyclic octahedron structure ( ξ ( C Y O n ) ).
Theorem 3.
Let C Y O n , for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the eccentric connectivity index of C Y O n is
ξ ( C Y O n ) = 4 n { 3 n + 7 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the eccentric connectivity index is:
ξ ( G ) = v V d v ε ( v ) .
Using the vertex partition from Table 1, we obtained the following computations:
ξ ( C Y O n ) = 4 · 4 n · n + 3 2 + 8 · n · n + 1 2 ,
ξ ( C Y O n ) = 8 n · ( n + 3 ) + 4 n · ( n + 1 ) ,
ξ ( C Y O n ) = 4 n { 3 n + 7 } .
 ☐
Theorem 4.
Let C Y O n , for all n 4 , where n is even, be the cyclic octahedron structure. Then, the eccentric connectivity index of C Y O n is
ξ ( C Y O n ) = 4 n { 3 n + 8 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the eccentric connectivity index is
ξ ( G ) = v V d v ε ( v ) .
Using the vertex partition from Table 2, we obtained the following computations:
ξ ( C Y O n ) = 4 · ( 2 n ) · n + 2 2 + 4 · ( 2 n ) · n + 4 2 + 8 · n · n + 2 2 ,
ξ ( C Y O n ) = 4 n · ( n + 4 ) + 8 n · ( n + 2 ) ,
ξ ( C Y O n ) = 4 n { 3 n + 8 } .
 ☐

2.3. Total Eccentricity Index

Then, using the following theorems, we computed the total eccentricity index of the cyclic octahedron structure ( ζ ( C Y O n ) ).
Theorem 5.
Let C Y O n , for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the total eccentricity index (ζ) of C Y O n is
ζ ( C Y O n ) = n 2 { 5 n + 13 } .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the total eccentricity index is
ζ ( G ) = v V ( G ) ε ( v ) .
Using the vertex partitioned from Table 3, we obtained the following computations:
ζ ( C Y O n ) = n · n + 1 2 + 4 n · n + 3 2 ,
ζ ( C Y O n ) = n 2 { n + 1 + 4 n + 12 } ,
ζ ( C Y O n ) = n 2 { 5 n + 13 } .
 ☐
Theorem 6.
Let C Y O n , for all n 4 , where n is even, be the cyclic octahedron structure, then the total eccentricity index (ζ) of C Y O n is
ζ ( C Y O n ) = n 2 { 5 n + 14 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the total eccentricity index is
ζ ( G ) = v V ( G ) ε ( v ) .
Using the vertex partitioned from Table 4, we obtained the following computations
ζ ( C Y O n ) = 3 n · n + 2 2 + 2 n · n + 4 2 ,
ζ ( C Y O n ) = n 2 { 3 n + 6 + 2 n + 8 } ,
ζ ( C Y O n ) = n 2 { 5 n + 14 } .
 ☐

2.4. Average Eccentricity Index

In this section, we describe how the average eccentricity index of the cyclic octahedron structure ( a v e c ( C Y O n ) ) was determined.
Theorem 7.
Let C Y O n , for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the average eccentricity index ( a v e c ( C Y O n ) ) is
a v e c ( C Y O n ) = 1 10 { 5 n + 13 } .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the average eccentricity index is
a v e c ( G ) = 1 n ε i .
Using the vertex partitioned from Table 3, we obtained the following computations:
a v e c ( C Y O n ) = 1 5 n n · n + 1 2 + 4 n · n + 3 2 ,
a v e c ( C Y O n ) = n 10 n { n + 1 + 4 n + 12 } ,
a v e c ( C Y O n ) = 1 10 { 5 n + 13 } .
 ☐
Theorem 8.
Let C Y O n , for all n 4 , where n is even, be the cyclic octahedron structure. Then, the average eccentricity index ( a v e c ( C Y O n ) ) is
a v e c ( C Y O n ) = 1 10 { 5 n + 14 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The formula of the average eccentricity index is
a v e c ( G ) = 1 n ε i .
Using the vertex partitioned from Table 4, we obtained the following computations:
a v e c ( C Y O n ) = 1 5 n 3 n · n + 2 2 + 2 n · n + 4 2 ,
a v e c ( C Y O n ) = n 10 n { 3 n + 6 + 2 n + 8 } ,
a v e c ( C Y O n ) = 1 10 { 5 n + 14 } .
 ☐

2.5. First Zagreb Eccentricity Index

In this section, we describe how we found the first Zagreb eccentricity index of the cyclic octahedron structure ( M 1 ( C Y O n ) ).
Theorem 9.
Let C Y O n for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the first Zagreb eccentricity index M 1 ( C Y O n ) is
M 1 ( C Y O n ) = 4 n { 3 n + 7 } .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the first Zagreb eccentricity index is
M 1 ( G ) = u v E ( G ) [ ε ( u ) + ε ( v ) ] .
By using the values from Table 5, we obtained
M 1 ( C Y O n ) = n n + 1 2 + n + 1 2 + 6 n n + 1 2 + n + 3 2 + 5 n n + 3 2 + n + 3 2 ,
M 1 ( C Y O n ) = n ( n + 1 ) + 6 n ( n + 2 ) + 5 n ( n + 3 ) ,
M 1 ( C Y O n ) = 4 n { 3 n + 7 } .
 ☐
Theorem 10.
Let C Y O n for all n 4 , where n is even, be the cyclic octahedron structure. Then, the first Zagreb eccentricity index ( M 1 ( C Y O n ) ) is
M 1 ( C Y O n ) = 4 n { 3 n + 8 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the first Zagreb eccentricity index is
M 1 ( G ) = u v E ( G ) [ ε ( u ) + ε ( v ) ] .
By using the values from Table 6, we obtained
M 1 ( C Y O n ) = 5 n n + 2 2 + n + 2 2 + 6 n n + 2 2 + n + 4 2 + n n + 4 2 + n + 4 2 ,
M 1 ( C Y O n ) = 5 n ( n + 2 ) + 6 n ( n + 3 ) + n ( n + 4 ) ,
M 1 ( C Y O n ) = 4 n { 3 n + 8 } .
 ☐

2.6. Second Zagreb Eccentricity Index

In this section, we describe how we found the second Zagreb eccentricity index of the cyclic octahedron structure ( M 1 ( C Y O n ) ).
Theorem 11.
Let C Y O n for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the second Zagreb eccentricity index ( M 1 ( C Y O n ) ) is
M 1 ( C Y O n ) = n 4 { 5 n 2 + 26 n + 37 } .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the second Zagreb eccentricity index is
M 1 ( G ) = v V ( G ) [ ε ( v ) ] 2 .
By using the values from Table 3, we obtained
M 1 ( C Y O n ) = n n + 1 2 2 + 4 n n + 3 2 2 ,
M 1 ( C Y O n ) = n 4 ( n 2 + 2 n + 1 + 4 n 2 + 24 n + 36 ) ,
M 1 ( C Y O n ) = n 4 { 5 n 2 + 26 n + 37 } .
 ☐
Theorem 12.
Let C Y O n for all n 4 , where n is even, be the cyclic octahedron structure. Then, the second Zagreb eccentricity index ( M 1 ( C Y O n ) ) is
M 1 ( C Y O n ) = n 4 { 5 n 2 + 28 n + 44 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the second Zagreb eccentricity index is
M 1 ( G ) = v V ( G ) [ ε ( v ) ] 2 .
By using the values from Table 4, we obtained
M 1 ( C Y O n ) = 3 n n + 2 2 2 + 2 n n + 4 2 2 ,
M 1 ( C Y O n ) = n 4 ( 3 n 2 + 12 n + 12 + 2 n 2 + 16 n + 32 ) = n 4 { 5 n 2 + 28 n + 44 } .
 ☐

2.7. Third Zagreb Eccentricity Index

In this section we describe how we found the third Zagreb eccentricity index of the cyclic octahedron structure ( M 2 ( C Y O n ) ).
Theorem 13.
Let C Y O n for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the third Zagreb eccentricity index ( M 2 ( C Y O n ) ) is
M 2 ( C Y O n ) = n { 3 n 2 + 14 n + 16 } .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the third Zagreb eccentricity index is
M 2 ( G ) = u v E ( G ) [ ε ( u ) · ε ( v ) ] .
By using the values from Table 5, we obtained
M 2 ( C Y O n ) = n n + 1 2 · n + 1 2 + 6 n n + 1 2 · n + 3 2 + 5 n n + 3 2 · n + 3 2 ,
M 2 ( C Y O n ) = n n + 1 2 2 + 6 n n 2 + 4 n + 3 4 + 5 n n + 3 2 2 ,
M 2 ( C Y O n ) = n { 3 n 2 + 14 n + 16 } .
 ☐
Theorem 14.
Let C Y O n for all n 4 , where n is even, be the cyclic octahedron structure. Then, the third Zagreb eccentricity index M 2 ( C Y O n ) is
M 2 ( C Y O n ) = n { 3 n 2 + 16 n + 21 } .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure contains 5 n vertices and 12 n edges.
The general formula of the third Zagreb eccentricity index is
M 2 ( G ) = u v E ( G ) [ ε ( u ) · ε ( v ) ] .
By using the values from Table 6, we obtained
M 2 ( C Y O n ) = 5 n n + 2 2 · n + 2 2 + 6 n n + 2 2 · n + 4 2 + n n + 4 2 · n + 4 2 ,
M 2 ( C Y O n ) = 5 n n + 2 2 2 + 6 n n 2 + 6 n + 8 4 + n n + 4 2 2 ,
M 2 ( C Y O n ) = n { 3 n 2 + 16 n + 21 } .
 ☐

2.8. Geometric-Arithmetic Index

In this section, we describe how we found the eccentricity-based geometric-arithmetic index of the cyclic octahedron structure G A 4 ( C Y O n ) .
Theorem 15.
Let C Y O n for all n 3 , where n is odd, be the cyclic octahedron structure. Then the geometric-arithmetic index ( G A 4 ( C Y O n ) ) is
G A 4 ( C Y O n ) = 6 n 1 + n 2 + 4 n + 3 n + 2 .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the eccentricity-based geometric-arithmetic index is
G A 4 ( G ) = u v ϵ E ( G ) 2 ε ( u ) · ε ( v ) ε ( u ) + ε ( v ) .
Using the edge partitioned from Table 5, we obtained the following computations:
G A 4 ( C Y O n ) = n 2 n + 1 2 · n + 1 2 n + 1 2 + n + 1 2 + 6 n 2 n + 1 2 · n + 3 2 n + 1 2 + n + 3 2 + 5 n 2 n + 3 2 · n + 3 2 n + 3 2 + n + 3 2 ,
G A 4 ( C Y O n ) = n 2 ( n + 1 2 ) 2 n + 1 + 6 n n 2 + 4 n + 3 n + 2 + 5 n 2 ( n + 3 2 ) 2 n + 3 ,
G A 4 ( C Y O n ) = 6 n 1 + n 2 + 4 n + 3 n + 2 .
 ☐
Theorem 16.
Let C Y O n for all n 4 , where n is even, be the cyclic octahedron structure. Then the geometric-arithmetic index ( G A 4 ( C Y O n ) ) is
G A 4 ( C Y O n ) = 6 n 1 + n 2 + 6 n + 8 n + 3 .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the eccentricity-based geometric-arithmetic index is
G A 4 ( G ) = u v ϵ E ( G ) 2 ε ( u ) · ε ( v ) ε ( u ) + ε ( v ) .
Using the edge partitioned from Table 6, we obtained the following computations:
G A 4 ( C Y O n ) = 5 n 2 n + 2 2 · n + 2 2 n + 2 2 + n + 2 2 + 6 n 2 n + 2 2 · n + 4 2 n + 2 2 + n + 4 2 + n 2 n + 4 2 · n + 4 2 n + 4 2 + n + 4 2 ,
G A 4 ( C Y O n ) = 5 n 2 ( n + 2 2 ) 2 n + 2 + 6 n n 2 + 6 n + 8 n + 3 + n 2 ( n + 4 2 ) 2 n + 4 ,
G A 4 ( C Y O n ) = 6 n 1 + n 2 + 6 n + 8 n + 3 .
 ☐

2.9. Atom Bond Connectivity Index

In this section, we desscribe how we found the eccentricity-based atom bond connectivity index of the cyclic octahedron structure ( A B C 5 ( C Y O n ) ).
Theorem 17.
Let C Y O n for all n 3 , where n is odd, be the cyclic octahedron structure. Then, the atom bond connectivity index ( A B C 5 ( C Y O n ) ) is
A B C 5 ( C Y O n ) = 2 n n 1 n + 1 + 5 n + 1 n + 3 + 6 n n 2 + 4 n + 3 .
Proof. 
Let C Y O n , where n is odd, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the eccentricity-based atom bond connectivity index is
A B C 5 ( G ) = u v ϵ E ( G ) ε ( u ) + ε ( v ) 2 ε ( u ) · ε ( v ) .
Using the edge partitioned from Table 5, we obtained the following computations:
A B C 5 ( C Y O n ) = n n + 1 2 + n + 1 2 2 n + 1 2 · n + 1 2 + 6 n n + 1 2 + n + 3 2 2 n + 1 2 · n + 3 2 + 5 n n + 3 2 + n + 3 2 2 n + 3 2 · n + 3 2 ,
A B C 5 ( C Y O n ) = n n + 1 2 ( n + 1 2 ) 2 + 12 n n + 2 2 n 2 + 4 n + 3 + 5 n n + 3 2 ( n + 3 2 ) 2 ,
A B C 5 ( C Y O n ) = 2 n n 1 n + 1 + 5 n + 1 n + 3 + 6 n n 2 + 4 n + 3 .
 ☐
Theorem 18.
Let C Y O n for all n 4 , where n is even, be the cyclic octahedron structure. Then the atom bond connectivity index ( A B C 5 ( C Y O n ) ) is
A B C 5 ( C Y O n ) = 2 n 5 n n + 2 + n + 2 n + 4 + 6 n + 1 n 2 + 6 n + 8 .
Proof. 
Let C Y O n , where n is even, be the cyclic octahedron structure containing 5 n vertices and 12 n edges.
The general formula of the eccentricity-based atom bond connectivity index is
A B C 5 ( G ) = u v ϵ E ( G ) ε ( u ) + ε ( v ) 2 ε ( u ) · ε ( v ) .
Using the edge partitioned from Table 6, we obtained the following computations:
A B C 5 ( C Y O n ) = 5 n n + 2 2 + n + 2 2 2 n + 2 2 · n + 2 2 + 6 n n + 2 2 + n + 4 2 2 n + 2 2 · n + 4 2 + n n + 4 2 + n + 4 2 2 n + 4 2 · n + 4 2 ,
A B C 5 ( C Y O n ) = 5 n n + 2 2 ( n + 2 2 ) 2 + 12 n n + 3 2 n 2 + 6 n + 8 + n n + 4 2 ( n + 4 2 ) 2 ,
A B C 5 ( C Y O n ) = 2 n 5 n n + 2 + n + 2 n + 4 + 6 n + 1 n 2 + 6 n + 8 .
 ☐

3. Comparison

In this section, we present tabular and graphical comparisons of the above computed indices. Table 8 shows a comparison of the eccentric connectivity index, total eccentricity, average eccentricity, first Zagreb index, second Zagreb index, third Zagreb index, atom bond connectivity index, and geometric arithmetic index for small values of n. Figure 3 shows a graphical comparison of the indices.

4. Conclusions

As depicted above in Figure 3 and Table 8, one can easily see the different aspects of behavior of the cyclic octahedron structure with respect to the eccentric-based indices.

Author Contributions

The contributions of author is as; The concept, editing and supervision of the article was given by Abdul Qudair Baig. All the computations, main editing of text and use of software were made by Muhammad Naeem. Data collection and correction was made by Manzoor Ahmed Zahid. The investigation, writing first draft and methodology of the proof was done by Muhammad Razwan Azhar.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Gao, W.; Wang, W.; Jamil, M.K.; Farahani, M.R. Electron Energy Studying of Molecular Structures via Forgotten Topological Index Computation. J. Chem. 2016, 2016, 1053183. [Google Scholar] [CrossRef]
  2. Gao, W.; Wang, W.F.; Jamil, M.K.; Farooq, R.; Farahani, M.R. Generalized atom-bond connectivity analysis of several chemical molecular graphs. Bulg. Chem. Commun. 2016, 48, 543–549. [Google Scholar]
  3. Hayat, S.; Imran, M. Computation of topological indices of certain network. Appl. Math. Comput. 2014, 240, 213–228. [Google Scholar] [CrossRef]
  4. Hayat, S.; Malik, M.A.; Imran, M. Computing topological indices of honeycomb derived networks. Rom. J. Inf. Sci. Technol. 2015, 18, 144–165. [Google Scholar]
  5. Hayat, S.; Imran, M. Computation of certain topological indices of nanotubes covered by C5 and C7. J. Comput. Theor. Nanosci. 2015, 12, 533–541. [Google Scholar] [CrossRef]
  6. Imran, M.; Hayat, S. On computation of topological indices of aztec diamonds. Sci. Int. 2014, 26, 1407–1412. [Google Scholar]
  7. Baig, A.Q.; Imran, M.; Ali, H. On topological indices of poly oxide, poly silicate, DOX, and DSL networks. Can. J. Chem. 2015, 93, 730–739. [Google Scholar] [CrossRef]
  8. Baig, A.Q.; Azhar, M.R.; Farahani, M.R.; Ediz, S. Some Eccentricity Based Topological Indices Of Tetra Sheets. Commun. Appl. Anal. 2017, 21, 631–646. [Google Scholar]
  9. Zhang, X.; Baig, A.Q.; Azhar, M.R.; Farahani, M.R.; Imran, M. The Average eccentricity and Eccentricity based Geometric-arithmetic index of tetra sheets. Int. J. Pure Appl. Math. 2017, 117, 467–479. [Google Scholar]
  10. Gao, W.; Farahani, M.R.; Jamil, M.K. The eccentricity version of atom-bond connectivity index of linear polycene parallelogram benzoid ABC5(P(n, n)). Acta Chim. Slov. 2016, 63, 376–379. [Google Scholar] [CrossRef] [PubMed]
  11. Li, M.Y.; Sevov, S.C. Mellitate-based co-ordination polymers with a recurring motif: Controlling dimensionality with secondary ligands. CrystEngComm 2013, 15, 5107–5113. [Google Scholar] [CrossRef]
  12. Klavzar, S.; Milutinovic, U. Graphs and a variant of the tower of Hanoi problem. Czech. Math. J. 1997, 47, 95–104. [Google Scholar] [CrossRef]
  13. Hinz, A.M.; Parisse, D. The Average Eccentricity of Sierpinski Graphs. Graphs Comb. 2012, 5, 671–686. [Google Scholar] [CrossRef]
  14. Ilic, A. On the extremal properties of the average eccentricity. Comput. Math. Appl. 2012, 64, 2877–2885. [Google Scholar] [CrossRef]
  15. Aouchiche, M. Comparaison Automatise D’Invariants En Theorie Des Graphes. Ph.D. Thesis, Ecole Polytechnique de Montreal, Montreal, QC, Canada, February 2006. [Google Scholar]
  16. Aouchiche, M.; Bonnefoy, J.M.; Fidahoussen, A.; Caporossi, G.; Hansen, P.; Hiesse, L.; Lachere, J.; Monhait, A. Variable neighborhood search for extremal graphs, 14. The AutoGraphiX 2 System. In Global Optimization: From Theory to Implementation; Liberti, L., Maculan, N., Eds.; Springer: Berlin, Germany, 2006; pp. 281–310. [Google Scholar]
  17. Caporossi, G.; Hansen, P. Variable neighborhood search for extremal graphs. I. the AutoGraphiX system. Discret. Math. 2000, 212, 29–44. [Google Scholar] [CrossRef]
  18. Dankelmann, P.; Goddard, W.; Swart, C.S. The average eccentricity of a graph and its subgraphs. Util. Math. 2004, 65, 41–51. [Google Scholar]
  19. Tang, Y.; Zhou, B. On average eccentricity. MATCH Commun. Math. Comput. Chem. 2012, 67, 405–423. [Google Scholar]
  20. 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. [Google Scholar] [CrossRef]
  21. Alaeiyan, M.; Asadpour, J. Computing the MEC polynomial of an infinite family of the linear parallelogram P(n, n), Optoelectron. Adv. Mater. Rapid Commun. 2012, 6, 191–193. [Google Scholar]
  22. Alaeiyan, M.; Mojarad, R.; Asadpour, J. A new method for computing eccentric connectivity polynomial of an infinite family of linear polycene parallelogram benzenod, Optoelectron. Adv. Mater. Rapid Commun. 2011, 5, 761–763. [Google Scholar]
  23. Farooq, R.; Ali Malik, M. On some eccentricity based topological indices of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2015, 9, 842–849. [Google Scholar]
  24. Bukley, F.; Harary, F. Distance in Graphs; Addison-Wesley: Redwood City, CA, USA, 1990. [Google Scholar]
  25. Ghorbani, M.; Hosseinzadeh, M.A. A new version of Zagreb indices. Filomat 2012, 26, 93–100. [Google Scholar] [CrossRef]
  26. 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. [Google Scholar]
  27. Ghorbani, M.; Khaki, A. A note on the fourth version of geometric-arithmetic index. Optoelectron. Adv. Mater. Rapid Commum. 2010, 4, 2212–2215. [Google Scholar]
  28. Farahani, M.R. Eccentricity version of atom bond connectivity index of benzenoid family ABC5(Hk). World Appl. Sci. J. Chem. 2013, 21, 1260–1265. [Google Scholar]
  29. Perry Iv, J.J.; Perman, J.A.; Zaworotko, M.J. Design and synthesis of metal-organic frameworks using metal-organic polyhedra as supermolecular building blocks. Chem. Soc. Rev. 2009, 38, 1400–1417. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Structure of an octahedron.
Figure 1. Structure of an octahedron.
Mathematics 06 00141 g001
Figure 2. Cyclic octahedral structure ( C Y O 8 ).
Figure 2. Cyclic octahedral structure ( C Y O 8 ).
Mathematics 06 00141 g002
Figure 3. Graphical behavior of the eccentric indices of the cyclic octahedron structure with different colors: ξ ( G ) is green, ζ ( G ) is red, a v e c ( G ) is blue, M 1 ( G ) = ξ ( G ) , M 1 ( G ) is black, M 2 ( G ) is cyan, G A 4 ( G ) is gold, and A B C 5 ( G ) is orange.
Figure 3. Graphical behavior of the eccentric indices of the cyclic octahedron structure with different colors: ξ ( G ) is green, ζ ( G ) is red, a v e c ( G ) is blue, M 1 ( G ) = ξ ( G ) , M 1 ( G ) is black, M 2 ( G ) is cyan, G A 4 ( G ) is gold, and A B C 5 ( G ) is orange.
Mathematics 06 00141 g003
Table 1. Eccentric-based indices.
Table 1. Eccentric-based indices.
S.No.Introduced byIndex NameNotationFormula
1V. Sharma et al. [20]Eccentric connectivity index ξ ( G ) v V d v ε ( v )
2M. Alaeiyan et al. [21,22]Eccentric connectivity polynomial E C P ( G , x ) v V d v x ε ( v )
3Farooq et al. [23]Total eccentricity index ζ ( G ) v V ε ( v )
4F. Bukley et al. [24]Average eccentricity a v e c ( G ) 1 n v V ε ( v )
5D. Vukičević et al.First Zagreb eccentric index M 1 ( G ) u v E [ ε ( u ) + ε ( v ) ]
Ghorbani et al. [25,26]Second Zagreb eccentric index M 1 ( G ) v V [ ε ( v ) ] 2
third Zagreb eccentric index M 2 ( G ) u v E ε ( u ) ε ( v )
6M. Ghorbani et al. [27]Geometric-arithmetic index G A 4 ( G ) u v ϵ E ( G ) 2 ε ( u ) · ε ( v ) ε ( u ) + ε ( v )
7Farahani [28]ABC eccentric index A B C 5 ( G ) u v E ( G ) ε ( v ) + ε ( u ) 2 ε ( v ) · ε ( u )
Table 2. Vertex partition of the cyclic octahedron structure for (n-levels) where n is odd based on the degree and eccentricity of each vertex with the existence of their frequencies.
Table 2. Vertex partition of the cyclic octahedron structure for (n-levels) where n is odd based on the degree and eccentricity of each vertex with the existence of their frequencies.
d u ε ( u ) FrequencyRange of n
4 n + 3 2 4 n n 3
8 n + 1 2 n n 3
Table 3. Vertex partition of the cyclic octahedron structure for (n-levels) where n is even based on the degree and eccentricity of each vertex with the existence of their frequencies.
Table 3. Vertex partition of the cyclic octahedron structure for (n-levels) where n is even based on the degree and eccentricity of each vertex with the existence of their frequencies.
d u ε ( u ) FrequencyRange of n
4 n + 2 2 2 n n 4
4 n + 4 2 2 n n 4
8 n + 2 2 n n 4
Table 4. Vertex partition of the cyclic octahedron structure for (n-levels) where n is odd based on the eccentricity of each vertex with the existence of their frequencies.
Table 4. Vertex partition of the cyclic octahedron structure for (n-levels) where n is odd based on the eccentricity of each vertex with the existence of their frequencies.
ε ( u ) FrequencyRange of n
n + 1 2 n n 3
n + 3 2 4 n n 3
Table 5. Vertex partition of the cyclic octahedron structure for (n-levels) where n is even based on the eccentricity of each vertex with existence of their frequencies.
Table 5. Vertex partition of the cyclic octahedron structure for (n-levels) where n is even based on the eccentricity of each vertex with existence of their frequencies.
ε ( u ) FrequencyRange of n
n + 2 2 3 n n 4
n + 4 2 2 n n 4
Table 6. Edge partition of the cyclic octahedron structure for (n-levels) where n is odd based on the eccentricity of end vertices with the existence of their frequencies.
Table 6. Edge partition of the cyclic octahedron structure for (n-levels) where n is odd based on the eccentricity of end vertices with the existence of their frequencies.
( ε ( u ) , ε ( v ) ) FrequencyRange of n
( n + 1 2 , n + 1 2 ) n n 3
( n + 1 2 , n + 3 2 ) 6 n n 3
( n + 3 2 , n + 3 2 ) 5 n n 3
Table 7. Edge partition of the cyclic octahedron structure for (n-levels) where n is even, based on the eccentricity of end vertices with the existence of their frequencies.
Table 7. Edge partition of the cyclic octahedron structure for (n-levels) where n is even, based on the eccentricity of end vertices with the existence of their frequencies.
( ε ( u ) , ε ( v ) ) FrequencyRange of n
( n + 2 2 , n + 2 2 ) 5 n n 4
( n + 2 2 , n + 4 2 ) 6 n n 4
( n + 4 2 , n + 4 2 ) n n 4
Table 8. Comparison of ξ ( G ) , ζ ( G ) , a v e c ( G ) , M 1 ( G ) , M 1 ( G ) , M 2 ( G ) , G A 4 ( G ) , and A B C 5 ( G ) of G C Y O n .
Table 8. Comparison of ξ ( G ) , ζ ( G ) , a v e c ( G ) , M 1 ( G ) , M 1 ( G ) , M 2 ( G ) , G A 4 ( G ) , and A B C 5 ( G ) of G C Y O n .
n ξ ( G ) ζ ( G ) avec ( G ) M 1 ( G ) M 1 ( G ) M 2 ( G ) GA 4 ( G ) ABC 5 ( G )
330466 3.3 30422148047.7 31.8
432068 3.4 32023653245.8 31.3
5600129 4.3 600 559.5 124871.8 43.7
6624132 4.4 624588135070 43.1
7992212 5.3 9921130256095.8 53.8
81024216 5.4 10241176272892.5 53.1
91480315 6.3 1480 1992.5 4560119.8 62.7
101520320 6.4 152020604810116.2 62.1

Share and Cite

MDPI and ACS Style

Zahid, M.A.; Baig, A.Q.; Naeem, M.; Azhar, M.R. Eccentricity-Based Topological Indices of a Cyclic Octahedron Structure. Mathematics 2018, 6, 141. https://doi.org/10.3390/math6080141

AMA Style

Zahid MA, Baig AQ, Naeem M, Azhar MR. Eccentricity-Based Topological Indices of a Cyclic Octahedron Structure. Mathematics. 2018; 6(8):141. https://doi.org/10.3390/math6080141

Chicago/Turabian Style

Zahid, Manzoor Ahmed, Abdul Qudair Baig, Muhammad Naeem, and Muhammad Razwan Azhar. 2018. "Eccentricity-Based Topological Indices of a Cyclic Octahedron Structure" Mathematics 6, no. 8: 141. https://doi.org/10.3390/math6080141

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop