On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si 2 C 3 - I [ p , q ] and Si 2 C 3 - II [ p , q ]

: 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 ﬁrst and multiplicative Zagreb indices, the multiplicative version of the atomic bond connectivity index, and the Generalized multiplicative Geometric Arithmetic index for silicon-carbon Si 2 C 3 − I [ p , q ] and Si 2 C 3 − II [ p , q ] second.


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].
Some indices are The first and second multiplicative Zagreb indices [16] are related to Wiener's work and defined as: and the Narumi-Katayama index [17]: 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: 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: Furthering the study of topological indices, the first and second hyper-Zagreb indices of a graph [22] are defined as: In [23], Kulli et al. defined the first and second generalized multiplicative Zagreb indices: Symmetry 2018, 10, 320 Multiplicative sum connectivity and multiplicative product connectivity indices [24] are defined as: 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 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 Si 2 C 3 − I[p, q] and Si 2 C 3 − I I[p, q]. Now we discuss the graph of Si 2 C 3 − I and Si 2 C 3 − I I.
In Figure 1, one unit of Si 2 C 3 − I is shown. Molecular graph of Si 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 Figures 3 and 4, we demonstrate how cells are connected in one row (chain) and how one row is connected to another row.
In Figures 1-4, carbon atoms are shown as brown, and silicon atoms Si are shown as blue.
Multiplicative sum connectivity and multiplicative product connectivity indices [24] are defined as: 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.
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       In Figures 1-4, carbon atoms are shown as brown, and silicon atoms Si are shown as blue. In Figure 5, one unit of 2 3 Si C II  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 2 3 Si C II  . The molecular graph of 2 3 Si C II  is shown in Figure 6 for p = 3 and q = 4. Figures 7 and 8 demonstrate how cells are connected in a row (chain) and how a row is connected to another row. We will use   2 3 , Si C II p q  to represent this molecular graph.   In Figures 1-4, carbon atoms are shown as brown, and silicon atoms Si are shown as blue. In Figure 5, one unit of 2 3 Si C II  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 2 3 Si C II  . The molecular graph of 2 3 Si C II  is shown in Figure 6 for p = 3 and q = 4. Figures 7 and 8 demonstrate how cells are connected in a row (chain) and how a row is connected to another row. We will use   2 3 , Si C II p q  to represent this molecular graph.   In Figures 1-4, carbon atoms are shown as brown, and silicon atoms Si are shown as blue. In Figure 5, one unit of 2 3 Si C II  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 2 3 Si C II  . The molecular graph of 2 3 Si C II  is shown in Figure 6 for p = 3 and q = 4. Figures 7 and 8 demonstrate how cells are connected in a row (chain) and how a row is connected to another row. We will use   2 3 , Si C II p q  to represent this molecular graph. In Figure 5, one unit of Si 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 Si 2 C 3 − I I. The molecular graph of Si 2 C 3 − I I is shown in Figure 6 for p = 3 and q = 4. Figures 7 and 8 demonstrate how cells are connected in a row (chain) and how a row is connected to another row. We will use Si 2 C 3 − I I[p, q] to represent this molecular graph.

Computational Results
In this section we give our main results.  (Figures 1-4), we can see that the total number of vertices are 10 pq , and total number of edges are 15 2 3 pq p q .

Computational Results
In this section we give our main results.  (Figures 1-4), we can see that the total number of vertices are 10 pq , and total number of edges are 15 2 3 pq p q .

Computational Results
In this section we give our main results.  (Figures 1-4), we can see that the total number of vertices are 10 pq , and total number of edges are 15 2 3 pq p q .

Computational Results
In this section we give our main results.  (Figures 1-4), we can see that the total number of vertices are 10 pq , and total number of edges are 15 2 3 pq p q .

Computational Results
In this section we give our main results.
Proof. Let G be the graph of Si 2 C 3 − I[p, q]. From the graph of Si 2 C 3 − I[p, q] (Figures 1-4), we can see that the total number of vertices are 10pq, and total number of edges are 15pq − 2p − 3q. The edge set of Si 2 C 3 − I[p, q] with p, q ≥ 1 has following five partitions: Additionally, it has
Proof. Let G be the graph of Additionally, it has .  Proof. Taking α = 1, in Theorem 6, we get our desired results.

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. Figures 1-8