Let G be a connected graph with vertex set V(G) and edge set E(G). Recently, the Revan vertex degree concept is defined in Chemical Graph Theory. The first and second Revan indices of G are defined as R1(G) =
Topological indices of large chemical structures such as metal organic frameworks can be extremely useful in both characterization of structures and computing their physico-chemical properties that are otherwise difficult to compute for such large networks of importance in reticular chemistry. Synthesis of novel reticular metal organic frameworks and networks in which covalent fibers weaved into crystals are becoming increasingly important in recent years , . A topological index is a numerical parameter mathematically derived from the graph structure. Numerous topological indices have been considered in Theoretical Chemistry and many topological indices are defined by using vertex degree concept. Among them, topological descriptors are of great importance, as they deal with topological characterizations of the molecules. In general, it acts like advanced models in the chemical and control field of applications.
The concept of topological index originated from the pioneering work of Wiener while he was attempting to find structural relationships to boiling points of paraffins. There are a large number of topological indices which are classified based on the structural properties of the graphs used for their calculations. In general, they are classified into distance-based topological indices, degree-based topological indices and counting related indices of graphs. The degree-based topological indices, which have reliable predicting power and thus they have been employed in deriving multi-linear regression models for statistical correlation of properties. The topological indices such as atom-bond connectivity and geometric-arithmetic are also used to predict the bio-activity of the chemical compounds. These classes of topological indices are of great importance and play a vital role in chemical characterization. More related contexts can refer to Zhao et al. , Basavanagoud et al. , Dobrynin et al. , Imran et al.  and Sardar et al. .
Very recently, Kulli defined a novel degree concept in graph theory: the Revan vertex degree and determined exact formulae for oxide and honeycomb networks. We consider only finite, simple and connected graph G. Let δ(G) denote the minimum degree and Δ(G) denote the maximum degree of graph G. The Revan vertex degree of a vertex v in G is defined as rG (v) = Δ(G) + δ(G) – dG(v). The first and second Revan indices of G are defined as:
where uv means that the vertex u and edge v are adjacent in G. The first and second hyper Revan indices of G are defined as
where rG (v) = Δ(G) + δ(G) –dG (v). We refer to  for details about these indices.
An octahedral sheet-like structure is a ring of octahedral structures which are linked to other rings by sharing corner vertices in a two dimensional plane. An octahedral network of dimension n is denoted by OTn, where n is the order of circumscribing. The numbers of vertices and edges in OTn with n ≥ 1 are 27n2 + 3n and 72n2 respectively. We study the Revan indices for the octahedral network as follows.
Let G = OTn be the octahedral network. Then the first and the second Revan indices of OTn are
Let G = OTn be the octahedral network. From figure 1, the edge partition of octahedral network OTn based on degrees of end vertices of each edge is given in table 1. First Revan index of OTn is calculated as
Edge partition of octahedral network
|(du, dv)||Number of edges||rG(u)||rG(v)|
|(4,4)||18n2 + 12n||8||8|
|(8,8)||18n2 — 12n||4||4|
Second Revan index of OTn is calculated as
Let G = OTn be the octahedral network. Then the first and the second hyper Revan indices of OTn are
Let G = OTn be the octahedral network. Then first hyper Revan index of OTn is calculated as
Second hyper Revan index of OTn is calculated as
Now we introduce another new network based on icosahedron. Icosahedral network is obtained from the octahedral network by replacing all the octahedra with the icosahedra. An n-dimensional icosahedral network is denoted by ISn. It has 63n2 + 3n number of vertices and 180n2 number of edges. We study the Revan and hyper Revan indices for the icosahedral network as follows.
Let G = ISn be the Icosahedral network. Then the first and the second Revan indices of ISn are
Let G = ISn be the Icosahedral network. Table 2 shows the edge partition of Icosahedral network of ISn based on degrees of end vertices of each edge.
Edge partition of Icosahedral Network
|(du, dv)||Number of edges||rG(u)||rG(v)|
|(5,5)||108n2 + 18n||10||10|
|(5,10)||54n2 — 6n||10||5|
|(10,10)||18n2 — 12n||5||5|
First Revan index of ISn is calculated as
Second Revan index of ISn is calculated as
Let G = ISn be the icosahedral network. Then the first and the second hyper Revan indices of ISn are
Let G = ISn be the icosahedral network. First hyper Revan index of ISn is calculated as
Second hyper Revan index of ISn is calculated as
In the present report, we have computed First and second Revan and hyper Revan indices of Octahedral and icosahedral networks.
Communicated by Juan L.G. Guirao
A. A. Dobrynin, R. Entringer, I. Gutman, (2001), Wiener index of trees: theory and applications, Acta Applicandae Mathematicae, 66(3), 211–249.