Next Article in Journal
Fundamental Homomorphism Theorems for Neutrosophic Extended Triplet Groups
Previous Article in Journal
CRCM: A New Combined Data Gathering and Energy Charging Model for WRSN
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]

1
Department of Mathematics, Dong-A University, Busan 49315, Korea
2
Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan
3
Department of Mathematics, Division of Science and Technology, University of Education, Lahore 54000, Pakistan
4
Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University, Jinju 52828, Korea
5
Center for General Education, China Medical University, Taichung 40402, Taiwan
*
Authors to whom correspondence should be addressed.
Symmetry 2018, 10(8), 320; https://doi.org/10.3390/sym10080320
Submission received: 4 June 2018 / Revised: 29 July 2018 / Accepted: 30 July 2018 / Published: 3 August 2018

Abstract

:
The application of graph theory in chemical and molecular structure research has far exceeded people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonds by edges. Topological indices help us to predict many physico-chemical properties of the concerned molecular compound. In this article, we compute Generalized first and multiplicative Zagreb indices, the multiplicative version of the atomic bond connectivity index, and the Generalized multiplicative Geometric Arithmetic index for silicon-carbon S i 2 C 3 I [ p , q ] and S i 2 C 3 II [ p , q ] second.

1. Introduction

For quite a few years, Chemical Graph theory has been assuming an imperative part in mathematical chemistry, quantitative structure-activity relationships (QSAR) and structure-property relationships (QSPR), and closeness/assorted variety investigation of sub-atomic libraries [1]. Essentially, molecular descriptors utilized as a part of these research fields are obtained from the graph of molecule, which speak to use some method to calculate numbers associated with molecular graph then using these number to describe molecule [1,2].
In chemical graph theory, a graph of molecule is a simple connected graph, in which atoms and chemical bonds are represented by vertices and edges respectively. A graph is connected if there is a connection between any pair of vertices. A network is a connected graph that has no multiple edge and loop. The number of vertices that are connected to a fixed vertex v is called the degree of v. The distance between two vertices is the length of the shortest path between them. The concept of valence in chemistry and the concept of degree in a graph is somehow closely related. For details on bases of graph theory, we refer to the book [3]. Throughout this paper, G denotes connected graph, V and E denote the vertex set and the edge set, respectively, and d v denotes the degree of a vertex.
The topological index of the graph of a chemical compound is the number associated with it. In 1947 Weiner laid the foundation of the topological index when he was approximating the boiling point of alkanes and introduced the Weiner index [4]. Till now, more than 140 topological indices are defined, but none of them is enough to determine all physico-chemical properties of understudy molecule. However, these indices together can do this to some extent. Later, in 1975, Milan Randić introduced Randić index [5]. In 1998, Bollobas and Erdos [6] and Amic et al. [7] defined the generalized Randić index, which got attention from both chemists and mathematicians [8]. The Randić index is one of the most popular, studied, and applied topological indices. Many reviews, papers, and books [9,10,11,12,13] are written on this simple graph invariant.
In 1972, Gutman introduced the first and the second Zagreb indices in [14].
M 1 ( G ) = u V ( G ) ( d u ) 2 = u v E ( G ) ( d u + d v ) ,
M 2 ( G ) = u v E ( G ) d u × d v .
These indices have applied to study molecular chirality, complexity, hetero-systems, and ZE-isomerism [15].
Some indices are The first and second multiplicative Zagreb indices [16] are related to Wiener’s work and defined as:
I I 1 ( G ) = u V ( G ) ( d u ) 2 ,
I I 2 ( G ) = u v E ( G ) d u × d v .
and the Narumi-Katayama index [17]:
N K ( G ) = u V ( G ) d u .
In computational chemistry, these types of indices are the focus of considerable research, like the Wiener index [18,19,20]. For example, in 2011. Gutman [18] studied and characterized the multiplicative first and second Zagreb indices for trees and determined the unique trees that give maximum and minimum values for M1(G) and M2(G), respectively. In [20], authors extended Gutman’s result and defined the following index for k-trees:
W 1 s ( G ) = u V ( G ) ( d u ) s .
Notice that for s = 1, 2 the above defined index is the Narumi-Katayama and Zagreb index, respectively. Based on the successful consideration of multiplicative Zagreb indices, M. Eliasi et al. [21] defined a new version of the multiplicative first Zagreb index as:
I I 1 ( G ) = u v E ( G ) ( d u + d v ) .
Furthering the study of topological indices, the first and second hyper-Zagreb indices of a graph [22] are defined as:
H I I 1 ( G ) = u v E ( G ) ( d u + d v ) 2 ,
H I I 2 ( G ) = u v E ( G ) ( d u × d v ) 2 .
In [23], Kulli et al. defined the first and second generalized multiplicative Zagreb indices:
M Z 1 a ( G ) = u v E ( G ) ( d u + d v ) a ,
M Z 2 a ( G ) = u v E ( G ) ( d u × d v ) a .
Multiplicative sum connectivity and multiplicative product connectivity indices [24] are defined as:
S C I I ( G ) = u v E ( G ) 1 d u + d v ,
P C I I ( G ) = u v E ( G ) 1 d u × d v .
Note that for α = 1 , first and second generalized multiplicative Zagreb indices are first and second multiplicative Zagreb indices, respectively, and for α = 2 , first and second generalized multiplicative Zagreb indices are first and second hyper multiplicative Zagreb indices, respectively. For α = 1 2 first and second generalized multiplicative Zagreb indices are multiplicative sum connectivity and multiplicative product connectivity indices.
Multiplicative atomic bond connectivity index, multiplicative Geometric arithmetic index, and generalized multiplicative Geometric arithmetic index are defined as
A B C I I ( G ) = u v E (   G ) d u + d v 2 d u × d v ,
G A I I ( G ) = u v E ( G ) 2 d u × d v d u + d v ,
G A a I I ( G ) = u v E ( G ) ( 2 d u × d v d u + d v ) a .
In this paper, we compute Generalized first and second multiplicative Zagreb indices, multiplicative version of Atomic bond connectivity index and Generalized multiplicative Geometric Arithmetic index for silicon-carbon S i 2 C 3 I [ p , q ] and S i 2 C 3 I I [ p , q ] . Now we discuss the graph of S i 2 C 3 I and S i 2 C 3 I I .
In Figure 1, one unit of S i 2 C 3 I is shown. Molecular graph of S i 2 C 3 I is shown in Figure 2, in which p denotes the number of cells attached in a single row and q denotes the number of total rows where each row contains p cells. In Figure 3 and Figure 4, we demonstrate how cells are connected in one row (chain) and how one row is connected to another row.
In Figure 1, Figure 2, Figure 3 and Figure 4, carbon atoms are shown as brown, and silicon atoms Si are shown as blue.
In Figure 5, one unit of S i 2 C 3 I I is given. By connecting p cells in a row and then connecting q rows where each row contains p cells, we get molecular graph of S i 2 C 3 I I . The molecular graph of S i 2 C 3 I I is shown in Figure 6 for p = 3 and q = 4. Figure 7 and Figure 8 demonstrate how cells are connected in a row (chain) and how a row is connected to another row. We will use S i 2 C 3 I I [ p , q ] to represent this molecular graph.

2. Computational Results

In this section we give our main results.
Theorem 1.
Let S i 2 C 3 I [ p , q ] be the Silicon Carbide. Then
M Z 1 a ( S i 2 C 3 I ) = ( 2 ) α ( 15 p q 7 p 9 q + 9 ) × ( 3 ) α ( 15 p q 9 p 13 q + 8 ) × ( 5 ) α ( 6 p + 8 q 9 ) .
M Z 2 a ( S i 2 C 3 I ) = ( 2 ) 4 α ( 2 p + 3 q 2 ) × ( 3 ) 6 α ( 5 p q + 2 p 3 q + 1 ) .
G A α I I ( S i 2 C 3 I ) = ( 2 ) α ( 9 p + 12 q 13 ) × ( 3 ) α ( 3 p + 4 q 5 ) × ( 5 ) α ( 9 6 p 8 q ) .
Proof. 
Let G be the graph of S i 2 C 3 I [ p , q ] . From the graph of S i 2 C 3 I [ p , q ] (Figure 1, Figure 2, Figure 3 and Figure 4), we can see that the total number of vertices are 10 p q , and total number of edges are 15 p q 2 p 3 q .
The edge set of S i 2 C 3 I [ p , q ] with p , q 1 has following five partitions:
E { 1 , 2 } ( S i 2 C 3 I [ p , q ] ) = { e = u v E ( S i 2 C 3 I [ p , q ] ) | d u = 1 , d v = 2 } ,
E { 1 , 3 } ( S i 2 C 3 I [ p , q ] ) = { e = u v E ( S i 2 C 3 I [ p , q ] ) | d u = 1 , d v = 3 } ,
E { 2 , 2 } ( S i 2 C 3 I [ p , q ] ) = { e = u v E ( S i 2 C 3 I [ p , q ] ) | d u = 2 , d v = 2 } ,
E { 2 , 3 } ( S i 2 C 3 I [ p , q ] ) = { e = u v E ( S i 2 C 3 I [ p , q ] ) | d u = 2 , d v = 3 } .
Additionally, it has
E { 3 , 3 } ( S i 2 C 3 I [ p , q ] ) = { e = u v E ( S i 2 C 3 I [ p , q ] ) | d u = 3 , d v = 3 } .
Now,
| E { 1 , 2 } ( S i 2 C 3 I [ p , q ] ) | = 1 ,
| E { 1 , 3 } ( S i 2 C 3 I [ p , q ] ) | = 1 ,
| E { 2 , 2 } ( S i 2 C 3 I [ p , q ] ) | = p + 2 q ,
| E { 2 , 3 } ( S i 2 C 3 I [ p , q ] ) | = 6 p 1 + 8 ( q 1 ) ,
and
| E { 3 , 3 } ( S i 2 C 3 I [ p , q ] ) | = 15 p q 9 p 13 q + 7 .  
M Z 1 a ( S i 2 C 3 I ) = u v E ( S i 2 C 3 I ) ( d u + d v ) α = ( 1 + 2 ) α × ( 1 + 3 ) α × ( 2 + 2 ) α ( p + 2 q ) × ( 2 + 3 ) α ( 6 p + 8 q 9 ) × ( 3 + 3 ) α ( 15 p q 9 p 13 q + 7 ) = ( 2 ) α ( 15 p q 7 p 9 q + 9 ) × ( 3 ) α ( 15 p q 9 p 13 q + 8 ) × ( 5 ) α ( 6 p + 8 q 9 ) .
M Z 2 a ( S i 2 C 3 I ) = u v E ( S i 2 C 3 I ) ( d u × d v ) α = ( 1 × 2 ) α × ( 1 × 3 ) α × ( 2 × 2 ) α ( p + 2 q ) × ( 2 × 3 ) α ( 6 p + 8 q 9 ) × ( 3 × 3 ) α ( 15 p q 9 p 13 q + 7 ) = ( 2 ) 4 α ( 2 p + 3 q 2 ) × ( 3 ) 6 α ( 5 p q + 2 p 3 q + 1 ) .
G A α I I ( S i 2 C 3 I ) = u v E ( S i 2 C 3 I ) ( 2 d u × d v d u + d v ) α = ( 2 1 × 2 1 + 2 ) α × ( 2 1 × 3 1 + 3 ) α × ( 2 2 × 2 2 + 2 ) α ( p + 2 q ) × ( 2 2 × 3 2 + 3 ) α ( 6 p + 8 q 9 ) × ( 2 3 × 3 3 + 3 ) α ( 15 p q 9 p 13 q + 7 ) = ( 2 ) α ( 9 p + 12 q 13 ) × ( 3 ) α ( 3 p + 4 q 5 ) × ( 5 ) α ( 9 6 p 8 q ) .
Theorem 2.
Let S i 2 C 3 I [ p , q ] be the Silicon Carbide. Then,
M Z 1 ( S i 2 C 3 I ) = I I 1 ( S i 2 C 3 I ) = ( 2 ) 15 p q 7 p 9 q + 9 × ( 3 ) 15 p q 9 p 13 q + 8 × ( 5 ) 6 p + 8 q 9 .
M Z 2 ( S i 2 C 3 I ) = I I 2 ( S i 2 C 3 I ) = ( 2 ) 4 ( 2 p + 3 q 2 ) × ( 3 ) 6 ( 5 p q + 2 p 3 q + 1 ) .
G A I I ( S i 2 C 3 I )   = ( 2 ) 9 p + 12 q 13 × ( 3 ) 3 p + 4 q 5 × ( 5 ) 9 6 p 8 q .
Proof. 
Taking α = 1 , in Theorem 1, we get our desired results. ☐
Theorem 3.
Let S i 2 C 3 I [ p , q ] be the Silicon Carbide. Then,
H I I 1 ( S i 2 C 3 I ) = ( 3 ) 30 p q 18 p 26 q + 16 × ( 2 ) 30 p q 14 p 18 q + 18 × ( 5 ) 12 p + 16 q 18 .
H I I 2 ( S i 2 C 3 I ) = ( 2 ) 8 ( 2 p + 3 q 2 ) × ( 3 ) 12 ( 5 p q 2 p 3 q + 6 ) .
Proof. 
Taking α = 2 , in Theorem 1, we get our desired results. ☐
Theorem 4.
Let S i 2 C 3 I [ p , q ] be the Silicon Carbide. Then,
S C I I ( S i 2 C 3 I ) = ( 1 2 ) 1 + p + 2 q × ( 1 3 ) × ( 1 5 ) 6 p + 8 q 9 × ( 1 6 ) 15 p q 9 p 13 q + 7 .
P C I I ( S i 2 C 3 I ) = ( 1 2 ) 2 ( 2 p + 3 q 2 ) × ( 1 3 ) 3 ( 5 p q 2 p 3 q + 1 ) .
Proof. 
Taking α = 1 2 , in Theorem 1, we get our desired results. ☐
Theorem 5.
Let S i 2 C 3 I [ p , q ] be the Silicon Carbide. Then,
A B C I I ( S i 2 C 3 I ) = [ ( 1 2 ) 1 2 ] 16 p + 23 q 15 p q 16 × [ ( 1 3 ) 1 2 ] 15 p q 9 p 13 q + 8 .
Proof. 
A B C I I ( S i 2 C 3 I ) = u v E ( S i 2 C 3 I ) d u + d v 2 d u × d v = ( 1 + 2 2 1 × 2 ) × ( 1 + 3 2 1 × 3 ) × ( 2 + 2 2 2 × 2 ) p + 2 q × ( 2 + 3 2 2 × 3 ) 6 p + 8 q 9 × ( 3 + 3 2 2 × 3 ) 15 p q 9 p 13 q + 7 = [ ( 1 2 ) 1 2 ] 16 p + 23 q 15 p q 16 × [ ( 1 3 ) 1 2 ] 15 p q 9 p 13 q + 8 .
Theorem 6.
Let S i 2 C 3 I I [ p , q ] be the Silicon Carbide. Then,
M Z 1 a ( S i 2 C 3 I I ) = ( 2 ) α ( 15 p q 9 p 9 q + 13 ) × ( 3 ) α ( 15 p q 13 p 13 q + 13 ) × ( 5 ) α ( 8 p + 8 q 14 ) .
M Z 2 a ( S i 2 C 3 I I ) = ( 2 ) 12 α ( p + q 1 ) × ( 3 ) 3 α ( 10 p q + 6 p 6 q + 3 ) .
G A α I I ( S i 2 C 3 I I ) = ( 2 ) α ( 12 p + 12 q 19 ) × ( 3 ) α ( 4 p + 4 q 17 2 ) × ( 5 ) α ( 14 8 p 8 q ) .
Proof. 
Let G be the graph of S i 2 C 3 I I [ p , q ] . From the graph of S i 2 C 3 I I [ p , q ] (Figure 5, Figure 6, Figure 7 and Figure 8), we can see that the total number of vertices are 10 p q and total number of edges are 15 p q 3 p 3 q .
The edge set of S i 2 C 3 I I [ p , q ] with p , q 1 has following five partitions:
E { 1 , 2 } ( S i 2 C 3 I I [ p , q ] ) = { e = u v E ( S i 2 C 3 I I [ p , q ] ) | d u = 1 , d v = 2 } ,
E { 1 , 3 } ( S i 2 C 3 I I [ p , q ] ) = { e = u v E ( S i 2 C 3 I I [ p , q ] ) | d u = 1 , d v = 3 } ,
E { 2 , 2 } ( S i 2 C 3 I I [ p , q ] ) = { e = u v E ( S i 2 C 3 I I [ p , q ] ) | d u = 2 , d v = 2 } ,
E { 2 , 2 } ( S i 2 C 3 I I [ p , q ] ) = { e = u v E ( S i 2 C 3 I I [ p , q ] ) | d u = 2 , d v = 2 } .
Additionally, it has
E { 3 , 3 } ( S i 2 C 3 I I [ p , q ] ) = { e = u v E ( S i 2 C 3 I I [ p , q ] ) | d u = 3 , d v = 3 } .
Now,
| E { 1 , 2 } ( S i 2 C 3 I I [ p , q ] ) | = 2 ,  
| E { 1 , 3 } ( S i 2 C 3 I I [ p , q ] ) | = 1 ,
| E { 2 , 2 } ( S i 2 C 3 I I [ p , q ] ) | = 2 p + 2 q ,
| E { 2 , 3 } ( S i 2 C 3 I I [ p , q ] ) | = 8 p + 8 q 14 ,
and
| E { 3 , 3 } ( S i 2 C 3 I I [ p , q ] ) | = 15 p q 13 p 13 q + 11 .  
M Z 1 a ( S i 2 C 3 I I [ p , q ] ) = u v E ( S i 2 C 3 I I [ p , q ] ) ( d u + d v ) α = ( 1 + 2 ) 2 α × ( 1 + 3 ) α × ( 2 + 2 ) α ( 2 p + 2 q ) × ( 2 + 3 ) α ( 8 p + 8 q 14 ) × ( 3 + 3 ) α ( 15 p q 13 p 13 q + 11 ) = ( 2 ) α ( 15 p q 9 p 9 q + 13 ) × ( 3 ) α ( 15 p q 13 p 13 q + 13 ) × ( 5 ) α ( 8 p + 8 q 14 ) .
M Z 2 a ( S i 2 C 3 I I [ p , q ] ) = u v E ( S i 2 C 3 I I [ p , q ] ) ( d u × d v ) α = ( 1 × 2 ) 2 α × ( 1 × 3 ) α × ( 2 × 2 ) α ( 2 p + 2 q ) × ( 2 × 3 ) α ( 8 p + 8 q 14 ) × ( 3 × 3 ) α ( 15 p q 13 p 13 q + 11 ) = ( 2 ) 12 α ( p + q 1 ) × ( 3 ) 3 α ( 10 p q + 6 p 6 q + 3 ) .
G A α I I ( S i 2 C 3 I I [ p , q ] ) = u v E ( S i 2 C 3 I I [ p , q ] ) ( 2 d u × d v d u + d v ) α = ( 2 1 × 2 1 + 2 ) 2 α × ( 2 1 × 3 1 + 3 ) α × ( 2 2 × 2 2 + 2 ) α ( 2 p + 2 q ) × ( 2 2 × 3 2 + 3 ) α ( 8 p + 8 q 14 ) × ( 2 3 × 3 3 + 3 ) α ( 15 p q 13 p 13 q + 11 ) = ( 2 ) α ( 12 p + 12 q 19 ) × ( 3 ) α ( 4 p + 4 q 17 2 ) × ( 5 ) α ( 14 8 p 8 q ) .
Theorem 7.
Let S i 2 C 3 I I [ p , q ] be the Silicon Carbide. Then,
M Z 1 ( S i 2 C 3 I I ) = I I 1 ( S i 2 C 3 I I ) = ( 2 ) 15 p q 9 p 9 q + 13 × ( 3 ) 15 p q 13 p 13 q + 13 × ( 5 ) 8 p + 8 q 14 .
M Z 2 ( S i 2 C 3 I I ) = I I 2 ( S i 2 C 3 I I ) = ( 2 ) 12 ( p + q 1 ) × ( 3 ) 3 ( 10 p q + 6 p 6 q + 3 ) .
G A α I I ( S i 2 C 3 I I ) = ( 2 ) α ( 12 p + 12 q 19 ) × ( 3 ) α ( 4 p + 4 q 17 2 ) × ( 5 ) α ( 14 8 p 8 q ) .
Proof. 
Taking α = 1 , in Theorem 6, we get our desired results. ☐
Theorem 8.
Let S i 2 C 3 I I [ p , q ] be the Silicon Carbide. Then,
H I I 1 ( S i 2 C 3 I I ) = ( 2 ) 30 p q 18 p 18 q + 26 × ( 3 ) 30 p q 26 p 26 q + 26 × ( 5 ) 16 p + 16 q 28 .
H I I 2 ( S i 2 C 3 I I ) = ( 2 ) 24 ( p + q 1 ) × ( 3 ) 6 ( 10 p q 6 p 6 q + 3 ) .
Proof. 
Taking α = 2 , in Theorem 6, we get our desired results. ☐
Theorem 9.
Let S i 2 C 3 I I [ p , q ] be the Silicon Carbide. Then,
S C I I ( S i 2 C 3 I I ) = ( 1 2 ) 1 + 2 p + 2 q × ( 1 3 ) × ( 1 5 ) 4 p + 4 q 7 × ( 1 6 ) 15 p q 13 p 13 q + 11 .
P C I I ( S i 2 C 3 I I ) = ( 1 2 ) 6 ( p + q 1 ) × ( 1 3 ) 3 ( 5 p q 3 p 3 q + 1 2 ) .
Proof. 
Taking α = 1 2 , in Theorem 6, we get our desired results. ☐
Theorem 10.
Let S i 2 C 3 I I [ p , q ] be the Silicon Carbide. Then,
A B C I I ( S i 2 C 3 I I )   = [ ( 1 2 ) ] 23 2 p + 23 2 q 15 2 p q 12 × [ ( 1 3 ) 1 2 ] 15 p q 13 p 13 q + 11 .
Proof. 
A B C I I ( S i 2 C 3 I I [ p , q ] ) = u v E ( S i 2 C 3 I I [ p , q ] ) d u + d v 2 d u × d v = ( 1 + 2 2 1 × 2 ) × ( 1 + 3 2 1 3 ) × ( 2 + 2 2 2 × 2 ) p + 2 q × ( 2 + 3 2 2 × 3 ) 6 p + 8 q 9 × ( 3 + 3 2 2 × 3 ) 15 p q 9 p 13 q + 7 = [ ( 1 2 ) ] 23 2 p + 23 2 q 15 2 p q 12 × [ ( 1 3 ) 1 2 ] 15 p q 13 p 13 q + 11 .

3. Remarks

Multiplicative, degree-based topological indices for silicon-carbon have been investigated here. Our results can help us to understand the physical features, chemical reactivity, and biological activities of silicon-carbon. For example, the atom-bond connectivity (ABC) index provides a very good correlation for computing the strain energy of molecules [25]. ABC is used to describe the heats of formation of alkanes, resulting in a good quantitative structure-property relationship (QSPR) model (r = 0.9970) [26]. The GA index has as much predictive power as that of the Randic index, so the GA index is more useful than the Randic index [25]. The first and second Zagreb indices were found to occur for the computation of the total π-electron energy of molecules and have a strong relationship with Weiner index [27]. The computation of distance-based and counting-related topological indices for these symmetrical graphs is an open challenge and is yet to be investigated. Figure 1, Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7 and Figure 8 are taken from [28].

Author Contributions

Y.C.K. did formal Analysis of paper. A.u.R.V. computed the results. W.N. proposed the methodology and wrote the paper. M.A.R. supervised and S.M.K. validates the results.

Funding

This research is supported by the funds of Dong A University.

Acknowledgments

We thank the reviewers for their suggestions, which have helped us to improve the quality of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Todeschini, R.; Consonni, V. New local vertex invariants and molecular descriptors based on functions of the vertex degrees. Match Commun. Math. Comput. Chem. 2010, 64, 359–372. [Google Scholar]
  2. Todeschini, R.; Consonni, V. Molecular Descriptors for Chemoinformatics: Volume I: Alphabetical Listing/Volume II: Appendices, References; John Wiley & Sons: New York, NY, USA, 2009; Volume 41. [Google Scholar]
  3. West, D.B. Introduction to Graph Theory; Prentice-Hall: Upper Saddle River, NJ, USA, 2001; Volume 2. [Google Scholar]
  4. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
  5. Randic, M. Characterization of molecular branching. J. Am. Chem. Soc. 1975, 97, 6609–6615. [Google Scholar] [CrossRef]
  6. Bollobás, B.; Erdös, P. Graphs of extremal weights. Ars Comb. 1998, 50, 225–233. [Google Scholar] [CrossRef]
  7. Amić, D.; Bešlo, D.; Lučić, B.; Nikolić, S.; Trinajstić, N. The vertex-connectivity index revisited. J. Chem. Inf. Comput. Sci. 1998, 38, 819–822. [Google Scholar] [CrossRef]
  8. Hu, Y.; Li, X.; Shi, Y.; Xu, T.; Gutman, I. On molecular graphs with smallest and greatest zeroth-order general Randic index. Match Commun. Math. Comput. Chem. 2005, 54, 425–434. [Google Scholar]
  9. Li, X.; Gutman, I.; Randić, M. Mathematical Aspects of Randić-Type Molecular Structure Descriptors; Nankai University, Faculty of Science: Tianjin, China, 2006. [Google Scholar]
  10. Randić, M. On history of the Randić index and emerging hostility toward chemical graph theory. Match Commun. Math. Comput. Chem. 2008, 59, 5–124. [Google Scholar]
  11. Randić, M. The connectivity index 25 years after. J. Mol. Gr. Model. 2001, 20, 19–35. [Google Scholar] [CrossRef]
  12. Gutman, I.; Furtula, B. Recent Results in the Theory of Randić Index; University of Kragujevac and Faculty of Science Kragujevac: Kragujevac, Serbia, 2008. [Google Scholar]
  13. Li, X.; Shi, Y. A survey on the Randic index. Match Commun. Math. Comput. Chem. 2008, 59, 127–156. [Google Scholar]
  14. Gutman, I.; Trinajstić, N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
  15. Eliasi, M.; Vukicevic, D. Comparing the multiplicative Zagreb indices. Match Commun. Math. Comput. Chem. 2013, 69, 765–773. [Google Scholar]
  16. Gutman, I.; Ruscić, B.; Trinajstić, N.; Wilcox, C.F., Jr. Graph theory and molecular orbitals. XII. Acyclic polyenes. J. Chem. Phys. 1975, 62, 3399–3405. [Google Scholar] [CrossRef]
  17. Narumi, H.; Katayama, M. Simple Topological Index: A Newly Devised Index Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons; Hokkaido University, Memoirs of the Faculty of Engineering: Hokkaido, Japan, 1984; Volume 16, pp. 209–214. [Google Scholar]
  18. Gutman, I. Multiplicative Zagreb indices of trees. Bull. Soc. Math. Banja Luka 2011, 18, 17–23. [Google Scholar]
  19. Todeschini, R.; Ballabio, D.; Consonni, V. Novel molecular descriptors based on functions of new vertex degrees. In Novel Molecular Structure Descriptors—Theory and Applications I; Gutman, I., Furtula, B., Eds.; University of Kragujevac: Kragujevac, Serbia, 2010; pp. 73–100. [Google Scholar]
  20. Wang, S.; Wei, B. Multiplicative Zagreb indices of k-trees. Discret. Appl. Math. 2015, 180, 168–175. [Google Scholar] [CrossRef]
  21. Eliasi, M.; Iranmanesh, A.; Gutman, I. Multiplicative versions of first Zagreb index. Match Commun. Math. Comput. Chem. 2012, 68, 217. [Google Scholar]
  22. Kulli, V.R. Multiplicative Hyper-Zagreb Indices and Coindices of Graphs: Computing These Indices of Some Nanostructures. Int. Res. J. Pure Algebra 2016, 6, 2248–9037. [Google Scholar]
  23. Kulli, V.R.; Stone, B.; Wang, S.; Wei, B. Generalised multiplicative indices of polycyclic aromatic hydrocarbons and benzenoid systems. Zeitschrift für Naturforschung A 2017, 72, 573–576. [Google Scholar] [CrossRef]
  24. Kulli, V.R. Multiplicative connectivity indices of TUC4C8 [m, n] and TUC4 [m, n] nanotubes. J. Comput. Math. Sci. 2016, 7, 599–605. [Google Scholar]
  25. Imran, M.; Ali, M.A.; Ahmad, S.; Siddiqui, M.K.; Baig, A.Q. Topological Characterization of the Symmetrical Structure of Bismuth Tri-Iodide. Symmetry 2018, 10, 201. [Google Scholar] [CrossRef]
  26. Estrada, E.; Torres, L.; Rodriguez, L.; Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes. NISCAIR-CSIR 1998, 37A, 849–855. [Google Scholar]
  27. Zhou, B.; Gutman, I. Relations between Wiener, hyper-Wiener and Zagreb indices. Chem. Phys. Lett. 2004, 394, 93–95. [Google Scholar] [CrossRef]
  28. Imran, M.; Siddiqui, M.K.; Naeem, M.; Iqbal, M.A. On Topological Properties of Symmetric Chemical Structures. Symmetry 2018, 10, 173. [Google Scholar] [CrossRef]
Figure 1. Unit Cell of S i 2 C 3 I [ p , q ] .
Figure 1. Unit Cell of S i 2 C 3 I [ p , q ] .
Symmetry 10 00320 g001
Figure 2. Sheet of S i 2 C 3 I [ p , q ] for p = 4 and q = 3.
Figure 2. Sheet of S i 2 C 3 I [ p , q ] for p = 4 and q = 3.
Symmetry 10 00320 g002
Figure 3. Sheet of S i 2 C 3 I [ p , q ] for p = 4 and q = 1.
Figure 3. Sheet of S i 2 C 3 I [ p , q ] for p = 4 and q = 1.
Symmetry 10 00320 g003
Figure 4. Sheet of S i 2 C 3 I [ p , q ] for p = 4 and q = 2.
Figure 4. Sheet of S i 2 C 3 I [ p , q ] for p = 4 and q = 2.
Symmetry 10 00320 g004
Figure 5. One Unit of S i 2 C 3 I I [ p , q ] .
Figure 5. One Unit of S i 2 C 3 I I [ p , q ] .
Symmetry 10 00320 g005
Figure 6. Sheet of S i 2 C 3 I I [ p , q ] for p = 3 and q = 3.
Figure 6. Sheet of S i 2 C 3 I I [ p , q ] for p = 3 and q = 3.
Symmetry 10 00320 g006
Figure 7. Sheet of S i 2 C 3 I I [ p , q ] for p = 5 and q = 1.
Figure 7. Sheet of S i 2 C 3 I I [ p , q ] for p = 5 and q = 1.
Symmetry 10 00320 g007
Figure 8. Sheet of S i 2 C 3 I I [ p , q ] for p = 5 and q = 2.
Figure 8. Sheet of S i 2 C 3 I I [ p , q ] for p = 5 and q = 2.
Symmetry 10 00320 g008

Share and Cite

MDPI and ACS Style

Kwun, Y.C.; Virk, A.U.R.; Nazeer, W.; Rehman, M.A.; Kang, S.M. On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]. Symmetry 2018, 10, 320. https://doi.org/10.3390/sym10080320

AMA Style

Kwun YC, Virk AUR, Nazeer W, Rehman MA, Kang SM. On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]. Symmetry. 2018; 10(8):320. https://doi.org/10.3390/sym10080320

Chicago/Turabian Style

Kwun, Young Chel, Abaid Ur Rehman Virk, Waqas Nazeer, M. A. Rehman, and Shin Min Kang. 2018. "On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]" Symmetry 10, no. 8: 320. https://doi.org/10.3390/sym10080320

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