Next Article in Journal
Distance and Adjacency Energies of Multi-Level Wheel Networks
Previous Article in Journal
Time-Space Fractional Coupled Generalized Zakharov-Kuznetsov Equations Set for Rossby Solitary Waves in Two-Layer Fluids
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Topological Indices of mth Chain Silicate Graphs

1
School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
2
Department of Mathematics, Government College University Faisalabad (GCUF), Faisalabad 38023, Pakistan
3
Department of Mathematics, GC University Lahore, Lahore 54000, Pakistan
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(1), 42; https://doi.org/10.3390/math7010042
Submission received: 18 November 2018 / Revised: 12 December 2018 / Accepted: 15 December 2018 / Published: 4 January 2019

Abstract

:
A topological index is a numerical representation of a chemical structure, while a topological descriptor correlates certain physico-chemical characteristics of underlying chemical compounds besides its numerical representation. A large number of properties like physico-chemical properties, thermodynamic properties, chemical activity, and biological activity are determined by the chemical applications of graph theory. The biological activity of chemical compounds can be constructed by the help of topological indices such as atom-bond connectivity (ABC), Randić, and geometric arithmetic (GA). In this paper, Randić, atom bond connectivity (ABC), Zagreb, geometric arithmetic (GA), ABC4, and GA5 indices of the mth chain silicate S L ( m , n ) network are determined.

1. Introduction and Preliminary Results

Graph theory is a branch of numerical science in which we apply the apparatuses of the diagram hypothesis to demonstrate the phenomena of compounds scientifically. In chemical graph theory, the edges represent the covalent bonding between atoms, and the vertices of a molecular graph represent atoms. The significance of the molecular graph is that the hydrogen atom is omitted from it.
“A topological index is a quantity that is somehow calculated from the molecular graph and for which we believe that it reflects relevant structural features of the underlying molecule” [1]. Until the late 1970s, topological indices only had information on atom connectivity, but in this age, they have many properties of saturated hydrocarbons [2]. The whole theory of topological indices was started by Wiener [3] when he was doing the experiment on the boiling point of paraffin.
As a consequence of various experiments, we can claim that topological indices are useful in QSPR/QSAR studies. The correlation between physico-chemical properties (QSPR) and the biological activity relationships (QSAR) of the molecules was tested with the help of topological indices. It is pertinent to note that the topological indices have some major classes such as counted related topological indices, degree-based topological indices, and distance-based topological indices of graphs. The degree-based topological indices are very important in chemical graph theory to test the attributes of compounds and drugs, which have been mostly used in chemical and pharmacy engineering [4,5].
In 1975, Milan Randić put forward the topological index, which is based on degree, in his seminar paper [6]. His index was denoted by R 1 2 ( G ) and defined as:
R 1 2 ( G ) = u v E ( G ) 1 d e g ( u ) d e g ( v )
Randić named it the “branching index”, but then it was re-named [7,8] to the “connectivity index”. Currently, it is called the “Randić index” [9]. Let R α ( G ) be the general Randić index defined as:
R α ( G ) = u v E ( G ) ( d e g ( u ) d e g ( v ) ) α for α = 1 , 1 2 , 1 , 1 2
“Ruder Boskovic” is the group for theoretical chemistry at the Institute of Zagreb, and Balaban et al. was a member of this group. Therefore, he named the M 1 and M 2 topological indices as “Zagreb group indices”. Later on, the “Zagreb group index” was abbreviated to “Zagreb index”, and now, M 1 is renamed as the “first Zagreb index”; on the other hand, M 2 is called the “second Zagreb index”. These indices are defined as:
M 1 ( G ) = u v E ( G ) ( d e g ( u ) + d e g ( v ) )
M 2 ( G ) = u v E ( G ) ( d e g ( u ) d e g ( v ) )
A new topological index that is obtained by the extension of Equation (1), introduced by Emesto Estrada, is called the “atom-bond connectivity index” and defined as:
ABC ( G ) = u v E ( G ) d e g ( u ) + d e g ( v ) 2 d e g ( u ) d e g ( v )
The ABC4 index is the fourth version of the atom-bond connectivity index. The ABC4 index was formulated by Ghorbani et al. [10] and is defined as:
ABC 4 ( G ) = u v E ( G ) S u + S v 2 S u S v
Another topological index invented by Vukičević and Furtula [11] was named the “geometric-arithmetic index”. It is defined as:
GA ( G ) = u v E ( G ) 2 d e g ( u ) d e g ( v ) ( d e g ( u ) + d e g ( v ) )
GA5 is the fifth version of the geometric arithmetic index [12]. The GA5 index was proposed by Graovac et al. [13] and is defined as:
GA 5 ( G ) = u v E ( G ) 2 S u S v ( S u + S v )
In this article, graph G is to be taken as a graph with edge set E ( G ) and vertex set V ( G ) , and the degree of vertex u V ( G ) is denoted as d u and S u = v N G ( u ) S v where N G ( u ) = { v V ( G ) u v E ( G ) } .
Hayat et al. worked on the degree-based topological index, such as for silicate, hexagonal, honeycomb, and oxide [14]. For more conclusive results related to topological indices of chemical graphs and their graph invariants, see [15,16,17,18,19,20,21,22,23].
Construction of the Silicate Chain Graph:
SiO4 tetrahedra are found nearly in all the silicates. Silicates are immensely essential and complicated minerals. We get silicates from metal carbonates with sand or from fusing metal oxides. Silicates behave as the building blocks of the usual rock-forming minerals.
Consider a single tetrahedron (i.e., a pyramid having a triangular base). Place oxygen atoms at the four corners of a tetrahedron, and the silicon atom is bonded with equally-spaced atoms of oxygen. The resulting tetrahedron is a silicate tetrahedron, which is shown in Figure 1a, and when this tetrahedron joins with other tetrahedra linearly, then a single-row silicate chain is formed, as shown in Figure 1b. When two tetrahedra join together corner-to-corner, then each tetrahedron shares its oxygen atom with the other tetrahedron, as shown in Figure 1c. After this sharing, these two tetrahedra can be joined with two other tetrahedra, as in Figure 1d. Now, extend this structure in one direction, then double the silicate chain formed, as in Figure 1e, were m is the number of row lines and n is the number of edges in a row line.

2. Results for mth Chain Silicate

In this section, we calculate the closed results for topological indices, which are based on vertex degrees of the mth silicate chain. We compute the general Randić for α = 1 , 1 , 1 2 , 1 2 , ABC, GA, ABC4, and GA5 indices for the mth chain silicate in this section. The number of edges of the mth chain silicate are 6 m n . In the following theorem, the general Randić index for the mth chain silicate is computed.
Theorem 1.
The general Randić index for G S L ( m , n ) is equal to,
when m = n :
R α ( G ) = 36 ( 3 m n 6 n + 2 ) + 18 ( 3 m n + 3 n 4 ) + 9 ( 3 m + 2 ) , α = 1 ; 6 ( 3 m n 6 n + 2 ) + 3 2 ( 3 m n + 3 n 4 ) + 3 ( 3 m + 2 ) , α = 1 2 ; 1 36 ( 3 m n 6 n + 2 ) + 1 18 ( 3 m n + 3 n 4 ) + 1 9 ( 3 m + 2 ) , α = 1 ; 1 6 ( 3 m n 6 n + 2 ) + 3 m n + 3 n 4 3 2 + 1 3 ( 3 m + 2 ) , α = 1 2 .
when m < n :
Case 1: When m is odd and n is even and vice versa. For m > 1 ,
(i) when m is odd and n is even:
R α ( G ) = 36 ( 3 m n 2 n 4 m + 2 ) + 18 ( 3 m n + 2 n + m 5 ) + 9 ( 3 m + 3 ) , α = 1 ; 6 ( 3 m n 2 n 4 m + 2 ) + 3 2 ( 3 m n + 2 n + m 5 ) + 3 ( 3 m + 3 ) , α = 1 2 ; 1 36 ( 3 m n 2 n 4 m + 2 ) + 1 18 ( 3 m n + 2 n + m 5 ) + 1 9 ( 3 m + 3 ) , α = 1 ; 1 6 ( 3 m n 2 n 4 m + 2 ) + 3 m n + 2 n + m 5 3 2 + 1 3 ( 3 m + 3 ) , α = 1 2 .
(ii) when m is even and n is odd:
R α ( G ) = 36 ( 3 m n 2 n 4 m + 2 ) + 18 ( 3 m n + 2 n + m 8 ) + 9 ( 3 m + 6 ) , α = 1 ; 6 ( 3 m n 2 n 4 m + 2 ) + 3 2 ( 3 m n + 2 n + m 8 ) + 3 ( 3 m + 6 ) , α = 1 2 ; 1 36 ( 3 m n 2 n 4 m + 2 ) + 1 18 ( 3 m n + 2 n + m 8 ) + 1 9 ( 3 m + 6 ) , α = 1 ; 1 6 ( 3 m n 2 n 4 m + 2 ) + 3 m n + m + 2 n 8 3 2 + 1 3 ( 3 m + 6 ) , α = 1 2 .
Case 2: When m and n both are even:
R α ( G ) = 36 ( 3 m n 2 n 4 m + 2 ) + 18 ( 3 m n + 2 n + m 6 ) + 9 ( 3 m + 4 ) , α = 1 ; 6 ( 3 m n 2 n 4 m + 2 ) + 3 2 ( 3 m n + 2 n + m 6 ) + 3 ( 3 m + 4 ) , α = 1 2 ; 1 36 ( 3 m n 2 n 4 m + 2 ) + 1 18 ( 3 m n + 2 n + m 6 ) + 1 9 ( 3 m + 4 ) , α = 1 ; 1 6 ( 3 m n 2 n 4 m + 2 ) + 3 m n + 2 n + m 6 3 2 + 1 2 ( 3 m + 4 ) , α = 1 2 .
Case 3: When m and n both are odd:
R α ( G ) = 36 ( 3 m n 6 m 2 ) + 18 ( 3 m n + 3 m 2 ) + 9 ( 3 m + 4 ) , α = 1 ; 6 ( 3 m n 6 m 2 ) + 3 2 ( 3 m n + 3 m 2 ) + 3 ( 3 m + 4 ) , α = 1 2 ; 1 36 ( 3 m n 6 m 2 ) + 1 18 ( 3 m n + 3 m 2 ) + 1 9 ( 3 m + 4 ) , α = 1 ; 1 6 ( 3 m n 6 m 2 ) + 3 m n + 3 m 2 3 2 + 1 3 ( 3 m + 4 ) , α = 1 2 .
when m > n :
Case 1: When m is odd and n is even and vice versa. For m > 2 ,
(i) when m is odd and n is even:
R α ( G ) = 36 ( 3 m n 4 n 2 m ) + 18 ( 3 m n + 4 n m 1 ) + 9 ( 3 m + 1 ) , α = 1 ; 6 ( 3 m n 4 n 2 m ) + 3 2 ( 3 m n + 4 n m 1 ) + 3 ( 3 m + 1 ) , α = 1 2 ; 1 36 ( 3 m n 4 n 2 m ) + 1 18 ( 3 m n + 4 n m 1 ) + 1 9 ( 3 m + 1 ) , α = 1 ; 1 6 ( 3 m n 4 n 2 m ) + ( 3 m n + 4 n m 1 3 2 + 1 3 ( 3 m + 1 ) , α = 1 2 .
(ii) when m is even and n is odd:
R α ( G ) = 36 ( 3 m n 4 n 2 m ) + 18 ( 3 m n + 4 n m 4 ) + 9 ( 3 m + 4 ) , α = 1 ; 6 ( 3 m n 4 n 2 m ) + 3 2 ( 3 m n + 4 n m 4 ) + 3 ( 3 m + 4 ) , α = 1 2 ; 1 36 ( 3 m n 4 n 2 m ) + 1 18 ( 3 m n + 4 n m 4 ) + 1 9 ( 3 m + 4 ) , α = 1 ; 1 6 ( 3 m n 4 n 2 m ) + 3 m n + 4 n m 4 3 2 + 1 3 ( 3 m + 4 ) , α = 1 2 .
Case 2: When m and n both are even:
R α ( G ) = 36 ( 3 m n 4 n 2 m 2 ) + 18 ( 3 m n + 4 n m + 2 ) + 27 m , α = 1 ; 6 ( 3 m n 4 n 2 m 2 ) + 3 2 ( 3 m n + 4 n m + 2 ) + 9 m , α = 1 2 ; 1 36 ( 3 m n 4 n 2 m 2 ) + 1 18 ( 3 m n + 4 n m + 2 ) + m 3 , α = 1 ; 1 6 ( 3 m n 4 n 2 m 2 ) + 3 m n + 4 n m + 2 3 2 + m , α = 1 2 .
Case 3: When m and n both are odd. For n > 1 :
R α ( G ) = 36 ( 3 m n 4 n 2 m 2 ) + 18 ( 3 m n + 4 n m + 2 ) + 27 m , α = 1 ; 6 ( 3 m n 4 n 2 m 2 ) + 3 2 ( 3 m n + 4 n m + 2 ) + 9 m , α = 1 2 ; 1 36 ( 3 m n 4 n 2 m 2 ) + 1 18 ( 3 m n + 4 n m + 2 ) + m 3 , α = 1 ; 1 6 ( 3 m n 4 n 2 m 2 ) + 3 m n + 4 n m + 2 3 2 + m , α = 1 2 .
Proof. 
When m = n , m > 1 :
Let G be the chain silicate Figure 2, based on degree n. The E ( G ) can be divided into three partitions. The E 1 ( G ) have 3 m + 2 edges u v ; where d e g ( u ) = d e g ( v ) = 3 . The E 2 ( G ) have 3 m n + 3 n 4 edges u v , where d e g ( u ) = 3 and d e g ( v ) = 6 . The E 3 ( G ) have 3 m n 6 n + 2 edges u v ; where d e g ( u ) = d e g ( v ) = 6 . See Table 1 for the edge partitions of G . Thus, from Equation (2), it follows that:
R α ( G ) = u v E ( G ) ( d e g ( u ) d e g ( v ) ) α
For α = 1 :
R α ( G ) is the general Randić index, defined by:
R 1 ( G ) = j = 1 3 u v E j ( G ) d e g ( u ) · d e g ( v )
By using Table 1, we get the following:
R 1 ( G ) = 9 | E 1 ( G ) | + 18 | E 2 ( G ) | + 36 | E 3 ( G ) |
R 1 ( G ) = 36 ( 3 m n 6 n + 2 ) + 18 ( 3 m n + 3 n 4 ) + 9 ( 3 m + 2 ) .
For α = 1 2 :
We apply the formula of R α ( G ) .
R 1 2 ( G ) = j = 1 3 u v E j ( G ) d e g ( u ) · d e g ( v )
By using Table 1, we get:
R 1 2 ( G ) = 3 | E 1 ( G ) | + 2 3 | E 2 ( G ) | + 6 | E 3 ( G ) |
R 1 2 ( G ) = 6 ( 3 m n 6 n + 2 ) + 3 2 ( 3 m n + 3 n 4 ) + 3 ( 3 m + 2 )
For α = 1 :
We apply the formula of R α ( G ) .
R 1 ( G ) = j = 1 3 u v E j ( G ) 1 d e g ( u ) · d e g ( v )
R 1 ( G ) = 1 9 | E 1 ( G ) | + 1 18 | E 2 ( G ) | + 1 36 | E 3 ( G ) |
R 1 ( G ) = 1 36 ( 3 m n 6 n + 2 ) + 1 18 ( 3 m n + 3 n 4 ) + 1 9 ( 3 m + 2 )
For α = 1 2
We apply the formula of R α ( G ) .
R 1 2 ( G ) = j = 1 3 u v E j ( G ) 1 d e g ( u ) · d e g ( v )
R 1 2 ( G ) = 1 3 | E 1 ( G ) | + 1 3 2 | E 2 ( G ) | + 1 6 | E 3 ( G ) |
R 1 2 ( G ) = 1 6 ( 3 m n 6 n + 2 ) + 3 m n + 3 n 4 3 2 + 1 3 ( 3 m + 2 )
When m < n :
The proof of the following cases, (i) when m is odd and n is even, (ii) when m is even and n is odd, (iii) when m and n both are even, and (iv) when m and n both are odd, is the same as m = n by using Table 2, Table 3, Table 4 and Table 5, respectively.
When m > n :
The proof of the following cases, (i) when m is odd and n is even, (ii) when m is even and n is odd, (iii) when m and n both are even, and (iv) when m and n both are odd, is the same as m = n by using Table 6, Table 7, Table 8 and Table 9, respectively.  □
In this theorem, we find the result of the first Zagreb index for chain silicate.
Theorem 2.
For the chain silicate G , the first Zagreb index is equal to,
when m = n :
M 1 ( G ) = 12 ( 3 m n 6 n + 2 ) + 9 ( 3 m n + 3 n 4 ) + 6 ( 3 m + 2 )
when m < n :
Case 1: When m is odd and n is even or vice versa. For m > 1 ,
(i) when m is odd and n is even:
M 1 ( G ) = 12 ( 3 m n 2 n 4 m + 2 ) + 9 ( 3 m n + 2 n + m 5 ) + 6 ( 3 m + 3 )
(ii) when m is even and n is odd:
M 1 ( G ) = 12 ( 3 m n 2 n 4 m + 2 ) + 9 ( 3 m n + 2 n + m 8 ) + 6 ( 3 m + 6 )
Case 2: When m and n both are even.
M 1 ( G ) = 12 ( 3 m n 2 n 4 m + 2 ) + 9 ( 3 m n + 2 n + m 6 ) + 6 ( 3 m + 4 )
Case 3: When m and n both are odd.
M 1 ( G ) = 12 ( 3 m n 6 m 2 ) + 9 ( 3 m n + 3 m 2 ) + 6 ( 3 m + 4 )
when m > n :
Case 1: When m is odd and n is even or vice versa. For m > 2 ,
(i) when m is odd and n is even:
M 1 ( G ) = 12 ( 3 m n 4 n 2 m ) + 9 ( 3 m n + 4 n m 1 ) + 6 ( 3 m + 1 )
(ii) when m is even and n is odd:
M 1 ( G ) = 12 ( 3 m n 4 n 2 m ) + 9 ( 3 m n + 4 n m 4 ) + 6 ( 3 m + 4 )
Case 2: When m and n both are even.
M 1 ( G ) = 12 ( 3 m n 4 n 2 m 2 ) + 9 ( 3 m n + 4 n m + 2 ) + 18 m
Case 3: When m and n both are odd.
M 1 ( G ) = 12 ( 3 m n 4 n 2 m 2 ) + 9 ( 3 m n + 4 n m + 2 ) + 18 m
Proof. 
When m = n :
Let G denotes the chain silicate. By using the edge partition from Table 1, the result follows. From Equation (3), we have:
M 1 ( G ) = u v E ( G ) ( d e g ( u ) + d e g ( v ) ) = j = 1 3 u v E j ( G ) ( d e g ( u ) + d e g ( v ) )
M 1 ( G ) ) = 6 | E 1 ( G ) | + 9 | E 2 ( G ) | + 12 | E 3 ( G ) |
By doing some calculation, we get the following:
M 1 ( G ) = 12 ( 3 m n 6 n + 2 ) + 9 ( 3 m n + 3 n 4 ) + 6 ( 3 m + 2 )
When m < n :
The proof of the following cases, (i) when m is odd and n is even, (ii) when m is even and n is odd, (iii) when m and n both are even, and (iv) when m and n both are odd, is the same as m = n by using Table 2, Table 3, Table 4 and Table 5, respectively.
When m > n :
The proof of the following cases, (i) when m is odd and n is even, (ii) when m is even and n is odd, (iii) when m and n both are even, and (iv) when m and n both are odd, is the same as m = n by using Table 6, Table 7, Table 8 and Table 9, respectively.  □
Corollary 1.
M 2 ( G ) is always equal to R 1 ( G ) .
Now, we calculate the results of the following topological indices of chain silicate.
Theorem 3.
Let G be the chain silicate, based on degree n, then we have,
when m = n :
  • A B C ( G ) = 1 3 5 2 ( 3 m n 6 n + 2 ) + 1 3 7 2 ( 3 m n + 3 n 4 ) + 2 3 ( 3 m + 2 ) . For m > 1 ;
  • GA ( G ) = 6 m n + 3 m 3 n . For m > 1 ;
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 16 m + 20 ) + 2 15 7 ( 3 m 4 ) + 1 3 23 30 ( 3 m n 9 n 4 m + 14 ) + 2 27 13 ( 2 m 8 ) + 7 m 9 2 + 1 6 37 10 ( 4 m + 4 ) + 1 9 43 6 ( 2 m + 2 n 10 ) + 1 9 11 2 ( 3 m + 3 n 14 ) + 2 9 2 ( 4 m + 4 n 20 ) + 17 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 3 ;
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 9 n 4 m + 14 ) + 24 2 m 17 + 4 13 10 ( 4 m + 4 ) + 2 5 6 ( 2 m + 2 n 10 ) + 6 19 10 ( 3 m + 3 n 14 ) + 3 7 5 ( 4 m + 4 n 20 ) 11 m + 4 2 + 8 3 7 + 8 5 9 + 16 . For m > 3 .
when m < n :
Case 1: When m is odd and n is even or vice versa.
(i) when m is odd and n is even:
  • A B C ( G ) = 1 3 5 2 ( 3 m n 2 n 4 m + 2 ) + 1 3 7 2 ( 3 m n + 2 n + m 5 ) + 2 3 ( 3 m + 3 ) . For m > 1
  • GA ( G ) = 6 m n . For m > 1
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 12 n 4 m + 26 ) + 2 15 7 ( 3 m 3 ) + 1 3 23 30 ( 3 m n 7 n 6 m + 16 ) + 2 27 13 ( m + n 7 ) + 7 ( m + n 1 ) 18 2 + 1 6 37 10 ( 2 m + 2 n + 2 ) + 1 9 43 6 ( m + 3 n 11 ) + 1 9 11 2 ( m + 5 n 17 ) + 2 9 2 ( m + 7 n 23 ) + 17 2 + 11 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 2
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 7 n 6 m + 16 ) + 12 17 2 ( m + n 1 ) + 4 13 10 ( 2 m + 2 n + 2 ) + 2 5 6 ( m + 3 n 11 ) + 6 19 10 ( m + 5 n 17 ) + 3 7 5 ( m + 7 n 23 ) 11 n + 4 2 + 8 3 7 + 8 5 9 + 24 . For m > 2
(ii) when m is even and n is odd:
  • A B C ( G ) = 1 3 5 2 ( 2 4 m + 3 m n 2 n ) + 1 3 7 2 ( 3 m n + 2 n + m 8 ) + 2 3 ( 3 m + 6 ) . For m > 1
  • GA ( G ) = 6 m n . For m > 1
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 12 n 4 m + 26 ) + 2 15 7 ( 3 m 6 ) + 1 3 23 30 ( 3 m n 8 n 5 m + 18 ) + 2 27 13 ( m + n 7 ) + 7 ( m + n 1 ) 18 2 + 1 6 37 10 ( m + 3 n 11 ) + 1 9 43 6 ( m + 3 n 11 ) + 1 9 11 2 ( m + 5 n 17 ) + 2 9 2 ( m + 7 n 23 ) + 17 + 22 + 2 13 5 3 + 2 10 3 3 . For m > 2
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 8 n 5 m + 18 ) + 12 17 2 ( m + n 1 ) + 4 13 10 ( m + 3 n 11 ) + 2 5 6 ( m + 3 n 11 ) + 6 19 10 ( m + 5 n 17 ) + 3 7 5 ( m + 7 n 23 ) 11 n + 8 2 + 16 3 7 + 16 5 9 + 25 . For m > 2
Case 2: When m and n both are even.
  • A B C ( G ) = 1 3 5 2 ( 3 m n 2 n 4 m + 2 ) + 1 3 7 2 ( 3 m n + 2 n + m 6 ) + 2 3 ( 4 + 3 m )
  • GA ( G ) = 6 m n
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 16 m + 8 ) + 2 15 7 ( 3 m 2 ) + 1 3 23 30 ( 3 m n 16 n + 3 m + 36 ) + 2 27 13 ( m + n 6 ) + 7 ( m + n 2 ) ) 18 2 + 1 6 37 10 ( m + 3 n 2 ) + 1 9 43 6 ( 4 m 6 ) + 1 9 11 2 ( m + 5 n 20 ) + 2 9 2 ( 2 m + 6 n 24 ) + 17 2 + 11 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 2
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 16 n + 3 m + 36 ) + 12 17 2 ( m + n 2 ) + 4 13 10 ( m + 3 n 2 ) + 2 5 6 ( 4 m 6 ) + 6 19 10 ( m + 5 n 20 ) + 3 7 5 ( 2 m + 6 n 24 ) 12 m + n + 4 2 + 8 3 7 + 8 5 9 + 8 . For m > 2
Case 3: When m and n both are odd.
  • A B C ( G ) = 1 3 5 2 ( 3 m n 6 m 2 ) + 1 3 7 2 ( 3 m n + 3 m 2 ) + 2 3 ( 3 m + 4 )
  • GA ( G ) = 6 m n
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 20 n + 4 m + 48 ) + 2 15 7 ( 3 m 2 ) + 1 3 23 30 ( 3 m n 13 m + 4 ) + 2 27 13 ( m + n 6 ) + 7 ( m + n 2 ) ) 18 2 + 1 6 37 10 ( m + 3 n 2 ) + 1 9 43 6 ( m + 3 n 12 ) + 1 9 11 2 ( m + 5 n 20 ) + 2 9 2 ( m + 7 n 26 ) + 17 2 + 11 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 1
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 13 m + 4 ) + 12 17 2 ( m + n 2 ) + 4 13 10 ( m + 3 n 2 ) + 2 5 6 ( m + 3 n 12 ) + 6 19 10 ( m + 5 n 20 ) + 3 7 5 ( m + 7 n 26 ) + 8 m + 4 2 + 8 3 7 + 8 5 9 + 48 . For m > 1
when m > n :
Case 1: When m is odd and n is even or vice versa.
(i) when m is odd and n is even:
  • A B C ( G ) = 1 3 5 2 ( 3 m n 4 n 2 m ) + 1 3 7 2 ( 3 m n + 4 n m 1 ) + 2 3 ( 3 m + 1 ) . For m > 2
  • GA ( G ) = 6 m n . For m > 2
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 14 n 2 m + 12 ) + 2 15 7 ( m + 2 n 3 ) + 1 3 23 30 ( 3 m n 5 m 8 n + 11 ) + 2 27 13 ( m + n 9 ) + 7 ( m + n + 1 ) 18 2 + 1 6 37 10 ( m + 3 n + 7 ) + 1 9 43 6 ( m + 3 n 9 ) + 1 9 11 2 ( m + 5 n 11 ) + 2 9 2 ( m + 7 n 17 ) + 17 2 + 11 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 4
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 8 n 5 m + 11 ) + 12 17 2 ( m + n + 1 ) + 4 13 10 ( m + 3 n + 7 ) + 2 5 6 ( m + 3 n 9 ) + 6 19 10 ( m + 5 n 11 ) + 3 7 5 ( m + 7 n 17 ) 11 n + 4 2 + 8 3 7 + 8 5 9 + 8 . For m > 4
(ii) when m is even and n is odd:
  • A B C ( G ) = 1 3 5 2 ( 3 m n 4 n 2 m ) + 1 3 7 2 ( 3 m n + 4 n m 4 ) + 2 3 ( 3 m + 4 ) . For m > 2
  • GA ( G ) = 6 m n . For m > 2
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 14 n 2 m + 12 ) + 2 15 7 ( m + 2 n 6 ) + 1 3 23 30 ( 3 m n 8 n 5 m + 12 ) + 2 27 13 ( m + n 9 ) + 7 ( m + n + 1 ) 18 2 + 1 6 37 10 ( m + 3 n 5 ) + 1 9 43 6 ( m + 3 n 9 ) + 1 9 11 2 ( m + 5 n 11 ) + 2 9 2 ( m + 7 n 17 ) + 17 + 22 + 2 13 5 3 + 2 10 3 3 . For m > 4
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 8 n 5 m + 12 ) + 12 17 2 ( m + n + 1 ) + 4 13 10 ( m + 3 n 5 ) + 2 5 6 ( m + 3 n 9 ) + 6 19 10 ( m + 5 n 11 ) + 3 7 5 ( m + 7 n 17 ) 11 n + 4 2 + 16 3 7 + 16 5 9 + 9 . For m > 4
Case 2: When m and n both are even.
  • A B C ( G ) = 1 3 5 2 ( 3 m n 4 n 2 m 2 ) + 1 3 7 2 ( 3 m n + 4 n m + 2 ) + 2 m . For m > 2
  • GA ( G ) = 6 m n + 4 . For m > 2
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 14 n 2 m + 4 ) + 2 15 7 ( 3 m 6 ) + 1 3 23 30 ( 3 m n 6 n 7 m + 12 ) + 2 27 13 ( m + n 10 ) + 7 ( m + n + 2 ) 18 2 + 1 6 37 10 ( m + 3 n + 10 ) + 1 9 43 6 ( m + 3 n 8 ) + 1 9 11 2 ( m + 5 n 8 ) + 2 9 2 ( m + 7 n 14 ) + 17 2 + 11 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 6
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 6 n 7 m + 12 ) + 12 17 2 ( m + n + 2 ) + 4 13 10 ( m + 3 n + 10 ) + 2 5 6 ( m + 3 n 8 ) + 6 19 10 ( m + 5 n 8 ) + 3 7 5 ( m + 7 n 14 ) 13 n + 2 m + 4 2 + 8 3 7 + 8 5 9 4 . For m > 6
Case 3: When m and n both are odd.
  • A B C ( G ) = 1 3 5 2 ( 3 m n 4 n 2 m 2 ) + 1 3 7 2 ( 3 m n + 4 n m + 2 ) + 2 m . For m > 3 and n > 1
  • GA ( G ) = 6 m n + 4 . For m > 3 and n > 1
  • A B C 4 ( G ) = 1 15 29 2 ( 3 m n 12 n 4 m + 8 ) + 2 7 n 5 + 1 3 23 30 ( 3 m n 11 n 2 m + 2 ) + 2 27 13 ( m + n 10 ) + 7 ( m + n + 2 ) 18 2 + 1 6 37 10 ( m + 3 n + 10 ) + 1 9 43 6 ( m + 3 n 8 ) + 1 9 11 2 ( m + 5 n 8 ) + 2 9 2 ( m + 7 n 14 ) + 17 2 + 11 2 + 23 2 6 + 13 5 3 + 10 3 3 . For m > 5
  • G A 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 11 n 2 m + 2 ) + 12 17 2 ( m + n + 2 ) + 4 13 10 ( m + 3 n + 10 ) + 2 5 6 ( m + 3 n 8 ) + 6 19 10 ( m + 5 n 8 ) + 3 7 5 ( m + 7 n 14 ) 3 m 8 n + 4 2 + 8 3 7 + 8 5 9 + 6 . For m > 5
Proof. 
When m = n :
By using Table 1, we get,
ABC ( G ) = u v E ( G ) d e g ( u ) + d e g ( v ) 2 d e g ( u ) · d e g ( v ) = j = 1 3 u v E j ( G ) d e g ( u ) + d e g ( v ) 2 d e g ( u ) · d e g ( v ) .
ABC ( G ) = 2 3 | E 1 ( G ) | + 1 3 7 2 | E 2 ( G ) | + 10 6 | E 3 ( G ) |
By doing some calculation, we get
ABC ( G ) = 1 3 5 2 ( 3 m n 6 n + 2 ) + 1 3 7 2 ( 3 m n + 3 n 4 ) + 2 3 ( 3 m + 2 )
From Equation (7), we get:
GA ( G ) = u v E ( G ) 2 d e g ( u ) d e g ( v ) ( d e g ( u ) + d e g ( v ) ) = j = 1 3 u v E j ( G ) 2 d e g ( u ) d e g ( v ) ( d e g ( u ) + d e g ( v ) ) .
After some simplification, we get
GA ( G ) = 2 3 | E 1 ( G ) | + 2 3 2 | E 2 ( G ) | + | E 3 ( G ) |
By doing some calculation, we get:
GA = 6 m n + 3 m 3 n
For S u and S v , the edge set E ( G ) can be divided into fourteen edge partitions. The E 1 ( G ) contains six edges u v ; where S u = S v = 12 . The E 2 ( G ) have 3 m 4 edges u v , where S u = S v = 15 . The E 3 ( G ) have 4 m + 4 edges u v , where S u = 15 and S v = 24 . The E 4 ( G ) have six edges u v ; where S u = 12 and S v = 24 . The E 5 ( G ) have 4 m + 4 n 20 edges u v , where we have S u = 15 and S v = 27 . The E 6 ( G ) have 2 m edges u v , where S u = 24 and S v = 27 . The E 7 ( G ) have two edges u v , where S u = S v = 24 . The E 8 ( G ) have 2 m 8 edges u v , where S u = S v = 27 . The E 9 ( G ) have two edges u v , where S u = 18 and S v = 24 . The E 10 ( G ) have 2 m + 2 n 10 edges u v , where S u = 18 and S v = 27 . The E 11 ( G ) have 3 m n 4 m 9 n + 14 edges u v , where S u = 18 and S v = 30 . The E 12 ( G ) have two edges u v , where S u = 24 and S v = 30 . The E 13 ( G ) have 3 m + 3 n 14 edges u v , where S u = 27 and S v = 30 . The E 14 ( G ) have 3 m n 16 m + 20 edges u v , where S u = S v = 30 . Table 2 shows such an edge partition of G .
From Equation (6), we get:
ABC 4 ( G ) = u v E ( G ) S u + S v 2 S u S v = j = 1 14 u v E j ( G ) S u + S v 2 S u S v .
By using the edge partition given in Table 10, we get the following:
ABC 4 ( G ) = 22 12 | E 1 ( G ) | + 2 7 15 | E 2 ( G ) | + 1 6 37 10 | E 3 ( G ) | + 1 12 34 2 | E 4 ( G ) | + 2 10 405 | E 5 ( G ) | + 7 18 2 | E 6 ( G ) | + 46 24 | E 7 ( G ) | + 2 13 27 | E 8 ( G ) | + 1 6 10 3 | E 9 ( G ) | + 1 9 43 6 | E 10 ( G ) | + 1 6 46 15 | E 11 ( G ) | + 1 6 13 5 | E 12 ( G ) | + 1 9 55 10 | E 13 ( G ) | + 7 2 30 | E 14 ( G ) | .
After some calculation, we get
ABC 4 ( G ) = 1 15 29 2 ( 3 m n 16 m + 20 ) + 2 15 7 ( 3 m 4 ) + 1 3 23 30 ( 3 m n 9 n 4 m + 14 ) + 2 27 13 ( 2 m 8 ) + 7 m 9 2 + 1 6 37 10 ( 4 m + 4 ) + 1 9 43 6 ( 2 m + 2 n 10 ) + 1 9 11 2 ( 3 m + 3 n 14 ) + 2 9 2 ( 4 m + 4 n 20 ) + 17 2 + 23 2 6 + 13 5 3 + 10 3 3 .
From Equation (8), we get:
GA 5 ( G ) = u v E ( G ) 2 S u S v ( S u + S v ) = j = 1 14 u v E j ( G ) 2 S u S v ( S u + S v )
By using the edge partition given in Table 10, we have
GA 5 ( G ) = | E 1 ( G ) | + 15 12 | E 2 ( G ) | + 4 10 13 | E 3 ( G ) | + 2 2 3 | E 4 ( G ) | + 3 5 7 | E 5 ( G ) | + 12 2 17 | E 6 ( G ) | + | E 7 ( G ) | + | E 8 ( G ) | + 4 3 7 | E 9 ( G ) | + 2 6 5 | E 10 ( G ) | + 15 4 | E 11 ( G ) | + 4 5 9 | E 12 ( G ) | + 6 10 19 | E 13 | ( G ) + | E 14 ( G ) | .
After calculation, we get
GA 5 ( G ) = 3 m n + 1 4 15 ( 3 m n 9 n 4 m + 14 ) + 24 2 m 17 + 4 13 10 ( 4 m + 4 ) + 2 5 6 ( 2 m + 2 n 10 ) + 6 19 10 ( 3 m + 3 n 14 ) + 3 7 5 ( 4 m + 4 n 20 ) 11 m + 4 2 + 8 3 7 + 8 5 9 + 16 .
When m < n :
The proof of the following cases, (i) when m is odd and n is even, (ii) when m is even and n is odd, (iii) when m and n both are even, and (iv) when m and n both are odd, is the same as m = n by using Table 2 and Table 11, Table 3 and Table 12, Table 4 and Table 13, and Table 5 and Table 14, respectively.
When: m > n :
The proof of the following cases, (i) when m is odd and n is even, (ii) when m is even and n is odd, (iii) when m and n both are even, and (iv) when m and n both are odd, is the same as m = n by using Table 6 and Table 15, Table 7 and Table 16, Table 8 and Table 17, and Table 9 and Table 18, respectively. □

3. Conclusions

In this paper, we have studied and computed some degree-based topological indices for the mth chain silicate S L ( m , n ) network for the very first time. We have also calculated their structural closed formulas. These results help from the chemical point of view, as well as that of pharmaceutical science. Our research work has continued to derive new architectures from the chain silicate S L ( m , n ) network.

Author Contributions

The authors made equal contributions in the article. All authors read and approved the final manuscript.

Funding

This research was funded by the China Postdoctoral Science Foundation under Grant 2017M621579; the Postdoctoral Science Foundation of Jiangsu Province under Grant 1701081B; Project of Anhui Jianzhu University under Grant no. 2016QD116 and 2017dc03.

Acknowledgments

The authors would like to thank all the respected reviewers for their suggestions and useful comments, which resulted in an improved version of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Diudea, M.V.; Gutman, I.; Lorentz, J. Molecular Topology; Nova: Huntington, NY, USA, 2001. [Google Scholar]
  2. Devillers, J.; Balabaan, A.T. Topological Indices and Related Descriptors in QSAR and QSPR; Gordon and Breach Science Publishers: Philadelphia, PA, USA, 1999. [Google Scholar]
  3. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
  4. Liu, J.B.; Pan, X.F. Minimizing Kirchoff index among graphswith a given vertex bipartitieness. Appl. Math. Comput. 2016, 291, 84–88. [Google Scholar]
  5. Liu, J.B.; Pan, X.F.; Hu, F.T.; Hu, F.F. Asymtotic Laplacian-energy-like invariant of lattices. Appl. Math. Comput. 2015, 253, 205–214. [Google Scholar]
  6. Randić, M. On Characterization of molecular branching. J. Am. Chem. Soc. 1975, 97, 6609–6615. [Google Scholar] [CrossRef]
  7. Kier, L.B.; Hall, L.H.; Murray, W.J.; Randic, M. Molecular connectivity. I: Relationship to nonspecific local anesthesia. J. Pharm. Sci. 1975, 64, 1971–1974. [Google Scholar] [CrossRef] [PubMed]
  8. Kier, L.B.; Hall, L.H. Molecular Connectivity in Chemistry and Drug Research; Academic Press: New York, NY, USA, 1976. [Google Scholar]
  9. Gutman, I. Degree based topological indices. Croat. Chem. Acta 2013, 86, 351–361. [Google Scholar] [CrossRef]
  10. Ghorbani, M.; Hosseinzadeh, M.A. Computing ABC4 index of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2010, 4, 1419–1422. [Google Scholar]
  11. Vukičević, D.; Furtula, B. Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem. 2009, 4, 1369–1376. [Google Scholar] [CrossRef]
  12. Imran, M.; Baig, A.Q.; Ali, H. On topological properties of dominating devid derived networks. Can. J. Chem. 2016, 94, 137–148. [Google Scholar] [CrossRef]
  13. Hayat, S.; Imran, M. Computation of topological indices of certain networks. Appl. Math. Comput. 2014, 240, 213–228. [Google Scholar] [CrossRef]
  14. Bača, M.; Horváthová, J.; Mokrišová, M.; Suhányiová, A. On topological indices of fullerenes. Appl. Math. Comput. 2015, 251, 154–161. [Google Scholar] [CrossRef]
  15. Ali, H.; Siddiqui, H.M.A.; Shafiq, M.K. On Degree-Based Topological Descriptors of Oxide and Silicate Molecular Structures. MAGNT Res. Rep. 2016, 4, 135–142. [Google Scholar]
  16. Iranmanesh, A.; Zeraatkar, M. Computing GA index for some nanotubes. Optoelectron. Adv. Mater. Rapid Commun. 2010, 4, 1852–1855. [Google Scholar]
  17. Javaid, M.; Jung, C.Y. M-Polynomials and Topological Indices of Silicate and Oxide Networks. Int. J. Pure Appl. Math. 2017, 115, 129–152. [Google Scholar] [CrossRef]
  18. Lin, W.; Chen, J.; Chen, Q.; Gao, T.; Lin, X.; Cai, B. Fast computer search for trees with minimal ABC index based on tree degree sequences. MATCH Commun. Math. Comput. Chem. 2014, 72, 699–708. [Google Scholar]
  19. Liu, J.-B.; Ali, H.; Shafiq, M.K.; Munir, U. On Degree-Based Topological Indices of Symmetric Chemical Structures. Symmetry 2018, 10, 619. [Google Scholar] [CrossRef]
  20. Manuel, P.D.; Abd-El-Barr, M.I.; Rajasingh, I.; Rajan, B. An efficient representation of Benes networks and its applications. J. Discret. Algorithms 2008, 6, 11–19. [Google Scholar] [CrossRef] [Green Version]
  21. Palacios, J.L. A resistive upper bound for the ABC index. MATCH Commun. Math. Comput. Chem. 2014, 72, 709–713. [Google Scholar]
  22. Simonraj, F.; George, A. Topological Properties of few Poly Oxide, Poly Silicate, DOX and DSL Networks. Int. J. Futur. Comput. Commun. 2013, 2, 90–95. [Google Scholar] [CrossRef]
  23. Rajan, B.; William, A.; Grigorious, C.; Stephen, S. On certain topological indices of silicate, honeycomb and hexagonal networks. J. Comput. Math. Sci. 2012, 3, 498–556. [Google Scholar]
Figure 1. Chain silicate network.
Figure 1. Chain silicate network.
Mathematics 07 00042 g001
Figure 2. mth chain silicate ( S L ( m , n ) ).
Figure 2. mth chain silicate ( S L ( m , n ) ).
Mathematics 07 00042 g002
Table 1. Edge partition of silicate chain ( S L ( m , n ) ), when m = n , based on the degrees of the end vertices of each edge.
Table 1. Edge partition of silicate chain ( S L ( m , n ) ), when m = n , based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 2
( 3 , 6 ) 3 m n + 3 n 4
( 6 , 6 ) 3 m n 6 n + 2
Table 2. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is odd, based on the degrees of the end vertices of each edge.
Table 2. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is odd, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 3
( 3 , 6 ) 3 m n + m + 2 n 5
( 6 , 6 ) 3 m n 2 n 4 m + 2
Table 3. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is even, based on the degrees of the end vertices of each edge.
Table 3. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is even, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 6
( 3 , 6 ) 3 m n + m + 2 n 8
( 6 , 6 ) 3 m n 2 n 4 m + 2
Table 4. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n both are even, based on the degrees of the end vertices of each edge.
Table 4. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n both are even, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 4
( 3 , 6 ) 3 m n + m + 2 n 6
( 6 , 6 ) 3 m n 4 m 2 n + 2
Table 5. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n both are odd, based on the degrees of the end vertices of each edge.
Table 5. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n both are odd, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 4
( 3 , 6 ) 3 m n + 3 m 2
( 6 , 6 ) 3 m n 6 m 2
Table 6. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is odd, based on the degrees of end vertices of each edge.
Table 6. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is odd, based on the degrees of end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 1
( 3 , 6 ) 3 m n m + 4 n 1
( 6 , 6 ) 3 m n 2 m 4 n
Table 7. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is even, based on the degrees of the end vertices of each edge.
Table 7. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is even, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m + 4
( 3 , 6 ) 3 m n m + 4 n 4
( 6 , 6 ) 3 m n 2 m 4 n
Table 8. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n both are even, based on the degrees of the end vertices of each edge.
Table 8. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n both are even, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m
( 3 , 6 ) 3 m n m + 4 n + 2
( 6 , 6 ) 3 m n 2 m 4 n 2
Table 9. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n both are odd, based on the degrees of the end vertices of each edge.
Table 9. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n both are odd, based on the degrees of the end vertices of each edge.
( d u , d v ) Where uv E ( G ) Number of Edges
( 3 , 3 ) 3 m
( 3 , 6 ) 3 m n m + 4 n + 2
( 6 , 6 ) 3 m n 2 m 4 n 2
Table 10. Edge partition of silicate chain ( S L ( m , n ) ) based on the sum of degrees of the end vertices of each edge.
Table 10. Edge partition of silicate chain ( S L ( m , n ) ) based on the sum of degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) 2 m 8
( 15 , 15 ) 3 m 4 ( 18 , 24 ) 2
( 15 , 24 ) 4 m + 4 ( 18 , 27 ) 2 m + 2 n 10
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n 4 m 9 n + 14
( 15 , 27 ) 4 m + 4 n 20 ( 24 , 30 ) 2
( 24 , 27 ) 2 m ( 27 , 30 ) 3 m + 3 n 14
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n 16 m + 20
Table 11. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is odd, based on the sum of the degrees of the end vertices of each edge.
Table 11. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is odd, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) m + n 7
( 15 , 15 ) 3 m 3 ( 18 , 24 ) 2
( 15 , 24 ) 2 m + 2 n + 2 ( 18 , 27 ) m + 3 n 11
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n 6 m 7 n + 16
( 15 , 27 ) m + 7 n 23 ( 24 , 30 ) 2
( 24 , 27 ) m + n 1 ( 27 , 30 ) m + 5 n 17
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n 4 m 12 n + 26
Table 12. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is even, based on the sum of the degrees of the end vertices of each edge.
Table 12. Edge partition of silicate chain ( S L ( m , n ) ), when m < n and m is even, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 12 ( 27 , 27 ) m + n 7
( 15 , 15 ) 3 m 6 ( 18 , 24 ) 4
( 15 , 24 ) m + 3 n 11 ( 18 , 27 ) m + 3 n 11
( 12 , 24 ) 12 ( 18 , 30 ) 3 m n 5 m 8 n + 18
( 15 , 27 ) m + 7 n 23 ( 24 , 30 ) 4
( 24 , 27 ) m + n 1 ( 27 , 30 ) m + 5 n 17
( 24 , 24 ) 0 ( 30 , 30 ) 3 m n 4 m 12 n + 26
Table 13. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n are even, based on the sum of the degrees of the end vertices of each edge.
Table 13. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n are even, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) m + n 6
( 15 , 15 ) 3 m 2 ( 18 , 24 ) 2
( 15 , 24 ) m + 3 n 2 ( 18 , 27 ) 4 m 6
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n + 3 m 16 n + 36
( 15 , 27 ) 2 m + 6 n 24 ( 24 , 30 ) 2
( 24 , 27 ) m + n 2 ( 27 , 30 ) m + 5 n 20
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n 16 m + 8
Table 14. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n are odd, based on the sum of the degrees of the end vertices of each edge.
Table 14. Edge partition of silicate chain ( S L ( m , n ) ), when m < n , m and n are odd, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) m + n 6
( 15 , 15 ) 3 m 2 ( 18 , 24 ) 2
( 15 , 24 ) m + 3 n 2 ( 18 , 27 ) m + 3 n 12
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n 13 m + 4
( 15 , 27 ) m + 7 n 26 ( 24 , 30 ) 2
( 24 , 27 ) m + n 2 ( 27 , 30 ) m + 5 n 20
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n + 4 m 20 n + 48
Table 15. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is odd, based on the sum of the degrees of the end vertices of each edge.
Table 15. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is odd, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) m + n 9
( 15 , 15 ) m + 2 n 3 ( 18 , 24 ) 2
( 15 , 24 ) m + 3 n + 7 ( 18 , 27 ) m + 3 n 9
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n 5 m 8 n + 11
( 15 , 27 ) m + 7 n 17 ( 24 , 30 ) 2
( 24 , 27 ) m + n + 1 ( 27 , 30 ) m + 5 n 11
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n 2 m 14 n + 12
Table 16. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is even, based on the sum of the degrees of the end vertices of each edge.
Table 16. Edge partition of silicate chain ( S L ( m , n ) ), when m > n and m is even, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 12 ( 27 , 27 ) m + n 9
( 15 , 15 ) m + 2 n 6 ( 18 , 24 ) 4
( 15 , 24 ) m + 3 n 5 ( 18 , 27 ) m + 3 n 9
( 12 , 24 ) 12 ( 18 , 30 ) 3 m n 5 m 8 n + 12
( 15 , 27 ) m + 7 n 17 ( 24 , 30 ) 4
( 24 , 27 ) m + n + 1 ( 27 , 30 ) m + 5 n 11
( 24 , 24 ) 0 ( 30 , 30 ) 3 m n 2 m 14 n + 12
Table 17. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n are even, based on the sum of the degrees of the end vertices of each edge.
Table 17. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n are even, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) m + n 10
( 15 , 15 ) 3 m 6 ( 18 , 24 ) 2
( 15 , 24 ) m + 3 n + 10 ( 18 , 27 ) m + 3 n 8
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n 7 m 6 n + 12
( 15 , 27 ) m + 7 n 14 ( 24 , 30 ) 2
( 24 , 27 ) m + n + 2 ( 27 , 30 ) m + 5 n 8
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n 2 m 14 n + 4
Table 18. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n are odd, based on the sum of the degrees of the end vertices of each edge.
Table 18. Edge partition of silicate chain ( S L ( m , n ) ), when m > n , m and n are odd, based on the sum of the degrees of the end vertices of each edge.
( S u , S v ) Where uv E ( G ) Number of Edges ( S u , S v ) Where uv E ( G ) Number of Edges
( 12 , 12 ) 6 ( 27 , 27 ) m + n 10
( 15 , 15 ) 3 n ( 18 , 24 ) 2
( 15 , 24 ) m + 3 n + 10 ( 18 , 27 ) m + 3 n 8
( 12 , 24 ) 6 ( 18 , 30 ) 3 m n 2 m 11 n + 2
( 15 , 27 ) m + 7 n 14 ( 24 , 30 ) 2
( 24 , 27 ) m + n + 2 ( 27 , 30 ) m + 5 n 8
( 24 , 24 ) 2 ( 30 , 30 ) 3 m n 4 m 12 n + 8

Share and Cite

MDPI and ACS Style

Liu, J.-B.; Shafiq, M.K.; Ali, H.; Naseem, A.; Maryam, N.; Asghar, S.S. Topological Indices of mth Chain Silicate Graphs. Mathematics 2019, 7, 42. https://doi.org/10.3390/math7010042

AMA Style

Liu J-B, Shafiq MK, Ali H, Naseem A, Maryam N, Asghar SS. Topological Indices of mth Chain Silicate Graphs. Mathematics. 2019; 7(1):42. https://doi.org/10.3390/math7010042

Chicago/Turabian Style

Liu, Jia-Bao, Muhammad Kashif Shafiq, Haidar Ali, Asim Naseem, Nayab Maryam, and Syed Sheraz Asghar. 2019. "Topological Indices of mth Chain Silicate Graphs" Mathematics 7, no. 1: 42. https://doi.org/10.3390/math7010042

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