Next Article in Journal
SWOT Analysis of Blended Learning in Public Universities of Uganda: A Case Study of Muni University
Previous Article in Journal
Examining Consumers’ Attitudes toward Gmarket Online Shopping
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Some New Neighborhood Degree-Based Indices for Some Oxide and Silicate Networks

1
Department of Mathematics, National Institute of Technology Durgapur, Durgapur-713209, India
2
Department of Basic Sciences and Humanities (Mathematics), Calcutta Institute of Engineering and Management, Kolkata-700040, India
*
Author to whom correspondence should be addressed.
J 2019, 2(3), 384-409; https://doi.org/10.3390/j2030026
Submission received: 16 June 2019 / Revised: 20 August 2019 / Accepted: 21 August 2019 / Published: 24 August 2019

Abstract

:
Topological indices are numeric quantities that describes the topology of molecular structure in mathematical chemistry. An important area of applied mathematics is the chemical reaction network theory. Real-world problems can be modeled using this theory. Due to its worldwide applications, chemical networks have attracted researchers since their foundation. In this report, some silicate and oxide networks are studied, and exact expressions of some newly-developed neighborhood degree-based topological indices named as the neighborhood Zagreb index ( M N ), the neighborhood version of the forgotten topological index ( F N ), the modified neighborhood version of the forgotten topological index ( F N ), the neighborhood version of the second Zagreb index ( M 2 ), and neighborhood version of the hyper Zagreb index ( H M N ) are obtained for the aforementioned networks. In addition, a comparison among all the indices is shown graphically.

1. Introduction

Networks connect nodes that are somehow interconnected. Numerous personal computers connected together form a network. Cell phone users create a network. The networking process involves examining the best way to implement a network. Cheminformatics is a new area of research in which chemistry, mathematics, and information science are combined. That is how it caught the attention of researchers around the world. In this paper, we consider different silicate and oxide networks. The most abundant minerals in the Earth’s crust are silicates. In most frequently-found silicates, including almost all silicate minerals found in the crust of the Earth, each silicon atom comprises the center of a tetrahedron (Figure 1), the corners of which are occupied by oxygen atoms, connected to it by single covalent bonds according to the octet rule. Silicates are obtained by fusing metal oxides or metal carbonates from sand. We can get various silicate structures by combining different tetrahedron silicates. Similarly, silicate networks are built by different silicate structures. The oxide networks are obtained by removing silicon atoms from the center of tetrahedra. Here, we also consider the copper (II) oxide (cupric oxide) network. Copper has enormous applications in medical science. It plays an important role in the synthesis and stabilization of skin proteins, and it also has potent biocidal properties [1]. The copper (II) oxide (cupric oxide) forms an inorganic chemical compound C u O . This mineral is important in animals and plants. Copper (II) oxide is utilized in mineral and vitamin supplements as a copper source and is regarded as safe.
Molecular graphs are pictorial models of chemical compounds, assigning atoms as nodes and chemical bonds as edges. Throughout this report, we consider only molecular graphs [2,3,4]. We consider V ( G ) and E ( G ) as vertex and edge sets, respectively, for a graph G. The degree of a vertex u V ( G ) , denoted by d G ( u ) , is the number of edges that are incident to u in G. We say that a node u is a neighbor of another node v if u is adjacent to v in G. Here, δ G ( v ) represents the totality of degrees of all neighbors of v in G, i.e.,
δ G ( v ) = u N G ( v ) d G ( u ) ,
where N G ( v ) = { u V ( G ) : u v E ( G ) } . Graph theory creates a link between mathematics and chemistry by a useful tool named the topological index. A topological index is a real number associated with a graph obtained by certain rules such that two isomorphic graphs have the same topological index. It characterizes the topology of molecular structure. Topological indices play a vital role in the quantitative structure–property relationship (QSPR) and the quantitative structure–activity relationship (QSAR) models to predict different physico-chemical properties and bioactivity that help in drug discovery. Its applications in various fields such as nano-science, biotechnology, etc., are also remarkable. That is why it has attracted researchers’ attention worldwide. The journey of topological indices started when chemist Harold Wiener introduced the Wiener index [5] in 1947. Several topological indices have been introduced over the past decades based on the vertex degree. Inspired by the works [6,7,8], we designed some new degree-based topological indices [9,10] having nice correlations with entropy and the acentric factor. Their mean isomer degeneracy is also remarkable. These indices are defined as follows.
The neighborhood Zagreb index is denoted by M N ( G ) and is defined as:
M N ( G ) = v V ( G ) δ G ( v ) 2 .
The neighborhood version of the forgotten topological index is denoted by F N ( G ) and is defined as:
F N ( G ) = v V ( G ) δ G ( v ) 3 .
The modified neighborhood version of the forgotten topological index is denoted by F N ( G ) and is defined as:
F N ( G ) = u v E ( G ) [ δ G ( u ) 2 + δ G ( v ) 2 ] .
The neighborhood version of the second Zagreb index is denoted by M 2 ( G ) and is defined by:
M 2 ( G ) = u v E ( G ) [ δ G ( u ) δ G ( v ) ] .
The neighborhood version of the hyper Zagreb index is denoted by H M N ( G ) and is defined by:
H M N ( G ) = u v E ( G ) [ δ G ( u ) + δ G ( v ) ] 2 .
In [11,12,13,14,15,16,17,18,19], topological indices for different chemically important graphs were discussed. Baig et al. [20] derived topological indices for some silicate and oxide networks. Javaid et al. [21] discussed the topological properties of rhombus-type silicate and oxide networks. In [22], topological indices for the copper (II) oxide network were obtained. For further work related to this field, readers are referred to [23,24,25,26]. Motivated by those works, in this paper, we obtain some exact expressions of five novel indices described above for some silicate and oxide networks and compare the results graphically.
This paper is organized as follows. In the next section, the motivation behind this work is described. The usefulness of these indices is illustrated here. The computation of the topological indices for different silicate and oxide networks using vertex and edge partition procedures is presented in Section 3. The graphical representation of the results is shown here using MATLAB (9.2, The MathWorks, Inc., Natick, MA, USA) and Maple (2015.1, Maplesoft, Waterloo, ON Canada) software. We conclude this report with a comparative study of the indices for different networks under consideration.

2. Motivation

In order to determine the usefulness of a topological index to predict the physico-chemical behavior of a chemical compound, the correlation coefficient ( r ) between the physico-chemical properties and topological indices is calculated. In QSPR/QSAR analysis, the topological indices for which r 2 exceeds 0.8 are very useful. In [9,10], it was shown that the r 2 values of five topological indices M N , F N , F N , M 2 , and H M N have excellent correlations with entropy and the acentric factor for octane isomers. The r 2 values of those indices with entropy are 0.989, 0.88, 0.868, 0.926, and 0.879, respectively. The r 2 values of those indices with the acentric factor are 0.907, 0.989, 0.952, 0.819, and 0.961, respectively. Linear correlations of these indices with entropy and the acentric factor are depicted in Figure 2. The above-mentioned indices are therefore effective in QSPR/QSAR analysis with high statistical accuracy. Furthermore, their mean isomer degeneracy is also remarkable in comparison with other degree-based topological indices [9,10], which provides assurance of their good isomer discrimination ability. Calculating these indices for distinct chemically-important networks and composite graphs is therefore worthwhile. Here, we consider some oxide and silicate networks.

3. Computation of Topological Indices

In this section, we first discuss the vertex and edge partition of the networks, and then, using that partition, we obtain five topological indices discussed in the previous section for the networks. Here, we consider dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) )) networks, regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) ) networks, rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) ) networks, and the copper (II) oxide ( C u O ) network. The construction procedures of these networks are discussed in detail in [21,22,26]. The first three types of networks can be constructed from a honeycomb network H C ( n ) of dimension n (number of hexagonal layers) [26]. The structure of H C ( 3 ) is shown in Figure 3. To create the vertex and edge partitions, we consider the following notations.
V i = { u V ( G ) : δ G ( u ) = i } ,
E ( p , q ) = { u v E ( G ) : δ G ( u ) = p , δ G ( v ) = q } .
By | V i | and | E ( p , q ) | , we mean the cardinality of the sets V i and E ( p , q ) , respectively.

3.1. Dominating Silicate ( D S L ( n ) ) and Oxide ( D O X ( n ) )) Networks

In this subsection, we obtain the five aforementioned indices for dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) ) networks. The structures of D S L ( 3 ) and D O X ( 3 ) are depicted in Figure 4 and Figure 5, respectively. Dominating silicate networks have 45 n 2 39 n + 12 nodes and 108 n 2 108 n + 36 edges [20,26]. Dominating oxide networks admit 27 n 2 21 n + 6 nodes and 54 n 2 54 n + 18 edges [20,26]. Vertex and edge partitions for dominating silicate networks are as follows.
V ( D S L ( n ) ) = V 15 V 18 V 24 V 27 V 30 ,
E ( D S L ( n ) ) = E ( 15 , 15 ) E ( 15 , 24 ) E ( 15 , 27 ) E ( 18 , 27 ) E ( 18 , 30 ) E ( 24 , 24 ) E ( 24 , 27 ) E ( 27 , 30 ) E ( 30 , 30 )
Vertex and edge partitions for dominating oxide networks are as follows.
V ( D O X ( n ) ) = V 8 V 12 V 14 V 16 ,
E ( D O X ( n ) ) = E ( 8 , 12 ) E ( 8 , 14 ) E ( 12 , 12 ) E ( 12 , 14 ) E ( 14 , 16 ) E ( 16 , 16 ) .
Theorem 1.
The neighborhood Zagreb index ( M N ) of the dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) )) networks for n 2 is given by:
(i) 
M N ( D S L ( n ) ) = 30,132 n 2 38,016 n + 14,040 ,
(ii) 
M N ( D O X ( n ) ) = 6912 n 2 9072 n + 3408 .
Proof. 
The general formula of the neighborhood Zagreb index is given by:
M N ( G ) = v V ( G ) δ G ( v ) 2 .
(i)
Let G D S L ( n ) . Now, applying vertex partition (1) on the definition of the neighborhood Zagreb index, we get:
M N ( G ) = v V 15 δ G ( v ) 2 + v V 18 δ G ( v ) 2 + v V 24 δ G ( v ) 2 + v V 27 δ G ( v ) 2 + v V 30 δ G ( v ) 2 .
Using Table 1, we obtain:
M N ( G ) = | V 15 | ( 15 2 ) + | V 18 | ( 18 2 ) + | V 24 | ( 24 2 ) + | V 27 | ( 27 2 ) + | V 30 | ( 30 2 ) = ( 24 n 12 ) ( 15 2 ) + ( 18 n 2 30 n + 12 ) ( 18 2 ) + ( 6 n ) ( 24 2 ) + 12 ( n 1 ) ( 27 2 ) + ( 27 n 2 51 n + 24 ) ( 30 2 ) = 30,132 n 2 38,016 n + 14,040 .
(ii)
Let G D O X ( n ) . Now, using vertex partition (3) and Table 2 on the definition of the neighborhood Zagreb index, we obtain:
M N ( G ) = | V 8 | ( 8 2 ) + | V 12 | ( 12 2 ) + | V 14 | ( 14 2 ) + | V 16 | ( 16 2 ) = ( 12 n 6 ) ( 8 2 ) + ( 6 n ) ( 12 2 ) + 12 ( n 1 ) ( 14 2 ) + ( 27 n 2 51 n + 24 ) ( 16 2 ) .
After simplifying and arranging the terms, the required result can be obtained easily.
Hence the proof. ☐
Theorem 2.
The neighborhood versions of the forgotten topological index ( F N ) of the dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) )) networks for n 2 are given by:
(i) 
F N ( D S L ( n ) ) = 833,976 n 2 1,151,820 n + 441,288 ,
(ii) 
F N ( D O X ( n ) ) = 110,592 n 2 159,456 n + 62,304 .
Proof. 
The general formulation of the neighborhood version of the forgotten topological index is given by:
F N ( G ) = v V ( G ) δ G ( v ) 3 .
(i)
Let G D S L ( n ) . Using vertex partition (1) and Table 1 on the above formula, we have:
F N ( G ) = ( 24 n 12 ) ( 15 3 ) + ( 18 n 2 30 n + 12 ) ( 18 3 ) + ( 6 n ) ( 24 3 ) + 12 ( n 1 ) ( 27 3 ) + ( 27 n 2 51 n + 24 ) ( 30 3 ) = 8,33,976 n 2 11,51,820 n + 4,41,288 .
(ii)
Let G D O X ( n ) . Using vertex partition (3) and Table 2, the general formula of the F N index gives the following computation.
F N ( G ) = ( 12 n 6 ) ( 8 3 ) + ( 6 n ) ( 12 3 ) + 12 ( n 1 ) ( 14 3 ) + + ( 27 n 2 51 n + 24 ) ( 16 3 ) = 1,10,592 n 2 1,59,456 n + 62,304 .
Hence the proof. ☐
Theorem 3.
The modified neighborhood versions of the forgotten topological index ( F N ) of the dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) )) networks for n 2 are given by:
(i) 
F N ( D S L ( n ) ) = 163,296 n 2 215,136 n + 80,676 ,
(ii) 
F N ( D O X ( n ) ) = 27,648 n 2 37,824 n + 14,400 .
Proof. 
The general formula of the modified neighborhood version of the forgotten topological index is given by:
F N ( G ) = u v E ( G ) [ δ G ( u ) 2 + δ G ( v ) 2 ] .
(i)
Let G be the dominating silicate network with dimension n. Then, applying edge partition (2) on the definition of the F N index, we have:
F N ( G ) = u v E ( G ) [ δ G ( u ) 2 + δ G ( v ) 2 ] = u v E ( 15 , 15 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 15 , 24 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 15 , 27 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 18 , 27 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 18 , 30 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 24 , 24 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 24 , 27 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 27 , 30 ) [ δ G ( u ) 2 + δ G ( v ) 2 ] + u v E ( 30 , 30 ) [ δ G ( u ) 2 + δ G ( v ) 2 .
Using Table 3, we can obtain:
F N ( G ) = | E ( 15 , 15 ) | ( 15 2 + 15 2 ) + | E ( 15 , 24 ) | ( 15 2 + 24 2 ) + | E ( 15 , 27 ) | ( 15 2 + 27 2 ) + | E ( 18 , 27 ) | ( 18 2 + 27 2 ) + | E ( 18 , 30 ) | ( 18 2 + 30 2 ) + | E ( 24 , 24 ) | ( 24 2 + 24 2 ) + | E ( 24 , 27 ) | ( 24 2 + 27 2 ) + | E ( 27 , 30 ) | ( 27 2 + 30 2 ) + | E ( 30 , 30 ) | ( 30 2 + 30 2 ) = 6 ( 2 n 1 ) ( 15 2 + 15 2 ) + ( 24 n ) ( 15 2 + 24 2 ) + 24 ( n 1 ) ( 15 2 + 27 2 ) + 12 ( n 1 ) | ( 18 2 + 27 2 ) + ( 54 n 2 102 n + 48 ) ( 18 2 + 30 2 ) + ( 6 ) ( 24 2 + 24 2 ) + 12 ( n 1 ) ( 24 2 + 27 2 ) + 24 ( n 1 ) ( 27 2 + 30 2 ) + ( 54 n 2 114 n + 60 ) ( 30 2 + 30 2 ) .
After simplification, the desired result is clear.
(ii)
Let G be the dominating silicate network with dimension n.
Now, applying the vertex partition (4) and Table 4 on the definition of the F N index, we have:
F N ( G ) = | E ( 8 , 12 ) | ( 8 2 + 12 2 ) + | E ( 8 , 14 ) | ( 8 2 + 14 2 ) + | E ( 12 , 12 ) | ( 12 2 + 12 2 ) + | E ( 12 , 14 ) | ( 12 2 + 14 2 ) + | E ( 14 , 16 ) | ( 14 2 + 16 2 ) + | E ( 16 , 16 ) | ( 16 2 + 16 2 ) = ( 12 n ) ( 8 2 + 12 2 ) + 12 ( n 1 ) ( 8 2 + 14 2 ) + ( 6 ) ( 12 2 + 12 2 ) + 12 ( n 1 ) ( 12 2 + 14 2 ) + 24 ( n 1 ) ( 14 2 + 16 2 ) + ( 54 n 2 114 n + 60 ) ( 16 2 + 16 2 ) = 27,648 n 2 37,824 n + 14,400 .
Hence the theorem. ☐
Theorem 4.
The neighborhood versions of the second Zagreb index ( M 2 ) of the dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) )) networks for n 2 are given by:
(i) 
M 2 ( D S L ( n ) ) = 77,760 n 2 103,572 n + 39,258 ,
(ii) 
M 2 ( D O X ( n ) ) = 13,824 n 2 19,296 n + 7488 .
Proof. 
The general formula of the neighborhood version of the second Zagreb index is given by:
M 2 ( G ) = u v E ( G ) [ δ G ( u ) δ G ( v ) ] .
(i)
Let G D S L ( n ) . Now, applying the edge partition (2) and Table 3 on the definition of the neighborhood version of the second Zagreb index, we get the desired result as follows.
M 2 ( G ) = 6 ( 2 n 1 ) ( 15.15 ) + 24 n ( 15.24 ) + 24 ( n 1 ) ( 15.27 ) + 12 ( n 1 ) ( 18.27 ) + ( 54 n 2 102 n + 48 ) ( 18.30 ) + 6 ( 24.24 ) + 12 ( n 1 ) ( 24.27 ) + 24 ( n 1 ) ( 27.30 ) + ( 54 n 2 114 n + 60 ) ( 30.30 ) = 77,760 n 2 103,572 n + 39,258 .
(ii)
Let G D O X ( n ) . Applying the edge partition (4) and Table 4 on the definition of the neighborhood version of the second Zagreb index, we get the desired result as follows.
M 2 ( G ) = 12 n ( 8.12 ) + 12 ( n 1 ) ( 8.14 ) + 6 ( 12.12 ) + 12 ( n 1 ) ( 12.14 ) + 24 ( n 1 ) ( 14.16 ) + ( 54 n 2 114 n + 60 ) ( 16.16 ) = 13,824 n 2 19,296 n + 7488 .
Hence the proof. ☐
Theorem 5.
The neighborhood versions of the hyper Zagreb index ( H M N ) of the dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) )) networks for n 2 are given by:
(i) 
H M N ( D S L ( n ) ) = 318,816 n 2 422,280 n + 159,192 ,
(ii) 
H M N ( D O X ( n ) ) = 55,296 n 2 76,416 n + 29,376 .
Proof. 
(i)
Let G D S L ( n ) . Now, applying edge partition (2) and Table 3 on the definition of the H M N index, we get the following computation.
H M N ( G ) = u v E ( G ) [ δ G ( u ) + δ G ( v ) ] 2 = 6 ( 2 n 1 ) ( 15 + 15 ) 2 + ( 24 n ) ( 15 + 24 ) 2 + 24 ( n 1 ) ( 15 + 27 ) 2 + 12 ( n 1 ) ( ( 18 + 27 ) 2 + ( 54 n 2 102 n + 48 ) ( 18 + 30 ) 2 + 6 ( 24 + 24 ) 2 + 12 ( n 1 ) ( 24 + 27 ) 2 + 24 ( n 1 ) ( 27 + 30 ) 2 + ( 54 n 2 114 n + 60 ) ( 30 + 30 ) 2 = 318,816 n 2 422,280 n + 159,192 .
(ii)
Let G D O X ( n ) . Now, applying edge partition (4) and Table 4 on the definition of the H M N index, we get the following computation.
H M N ( G ) = u v E ( G ) [ δ G ( u ) + δ G ( v ) ] 2 = ( 12 n ) ( 8 + 12 ) 2 + 12 ( n 1 ) ( 8 + 14 ) 2 + 6 ( 12 + 12 ) 2 + 12 ( n 1 ) ( ( 12 + 14 ) 2 + 24 ( n 1 ) ( 14 + 16 ) 2 + ( 54 n 2 114 n + 60 ) ( 16 + 16 ) 2 = 55,296 n 2 76,416 n + 29,376 .
Hence the theorem. ☐
Five topological indices for D S L ( n ) and D O X ( n ) are shown graphically in Figure 6.

3.2. Regular Triangulene Silicate ( R T S L ( n ) ) and Oxide ( R T O X ( n ) ) Networks

In this subsection, we obtain the five aforementioned indices for regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) ) networks. The structures of R T S L ( 5 ) and R T O X ( 5 ) are shown in Figure 7 and Figure 8, respectively. Using the method described in [26], it can be said that regular triangulene silicate networks have 5 n 2 + 15 n + 2 2 nodes and 3 n 2 + 31 n 28 edges. The regular triangulene oxide network admits 3 n 2 + 9 n + 2 2 nodes and 3 n 2 + 6 n edges [23,26]. Vertex and edge partitions for the regular triangulene silicate network are as follows.
V ( R T S L ( n ) ) = V 12 V 15 V 18 V 24 V 27 V 30 ,
E ( R T S L ( n ) ) = E ( 12 , 12 ) E ( 12 , 15 ) E ( 12 , 24 ) E ( 15 , 15 ) E ( 15 , 24 ) E ( 15 , 27 ) E ( 18 , 24 ) E ( 18 , 27 ) E ( 18 , 30 ) E ( 24 , 24 ) E ( 24 , 27 ) E ( 27 , 27 ) E ( 27 , 30 ) E ( 30 , 30 ) .
Vertex and edge partitions for the regular triangulene oxide network are as follows.
V ( R T O X ( n ) ) = V 6 V 8 V 12 V 14 V 16 ,
E ( R T O X ( n ) ) = E ( 6 , 6 ) E ( 6 , 12 ) E ( 8 , 12 ) E ( 8 , 14 ) E ( 12 , 12 ) E ( 12 , 14 ) E ( 14 , 14 ) E ( 14 , 16 ) E ( 16 , 16 ) .
Theorem 6.
The neighborhood Zagreb index ( M N ) of the regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) )) networks for n 2 is given by:
(i) 
M N ( R T S L ( n ) ) = 1674 n 2 + 1674 n 702 ,
(ii) 
M N ( R T O X ( n ) ) = 384 n 2 + 216 n 208 .
Proof. 
The general formula of the neighborhood Zagreb index is given by:
M N ( G ) = v V ( G ) δ G ( v ) 2 .
(i)
Let G R T S L ( n ) . Now, apply vertex partition (5) and Table 5 on the definition of the neighborhood Zagreb index, we get:
M N ( G ) = | V 12 | ( 12 2 ) + | V 15 | ( 15 2 ) + | V 18 | ( 18 2 ) + | V 24 | ( 24 2 ) + | V 27 | ( 27 2 ) + | V 30 | ( 30 2 ) = ( 4 ) ( 12 2 ) + ( 6 n 2 ) ( 15 2 ) + ( n 2 ) ( 18 2 ) + ( 4 ) ( 24 2 ) + ( 6 n 8 ) ( 27 2 ) + ( 3 n 2 9 n + 6 2 ) ( 30 2 ) .
After simplification, the desired result can be obtained easily.
(ii)
Let G R T O X ( n ) . Now, using vertex partition (7) and Table 6 on the definition of the neighborhood Zagreb index, we obtain:
M N ( G ) = | V 6 | ( 6 2 ) + | V 8 | ( 8 2 ) + | V 12 | ( 12 2 ) + | V 14 | ( 14 2 ) + | V 16 | ( 16 2 ) = ( 4 ) ( 6 2 ) + ( 3 n 2 ) ( 8 2 ) + ( 4 ) ( 12 2 ) + ( 6 n 8 ) ( 14 2 ) + ( 3 n 2 9 n + 6 2 ) ( 16 2 ) .
After simplifying and arranging the terms, the required result can be obtained easily.
Hence the proof. ☐
Theorem 7.
The neighborhood version of the forgotten topological index ( F N ) of the regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) )) networks for n 2 is given by:
(i) 
F N ( R T S L ( n ) ) = 46,332 n 2 + 16,848 n + 113,994 ,
(ii) 
F N ( R T O X ( n ) ) = 6144 n 2 432 n 2912 .
Proof. 
The general formulation of the neighborhood version of the forgotten topological index is given by:
F N ( G ) = v V ( G ) δ G ( v ) 3 .
(i)
Let G be a regular triangulene silicate network having dimension n. Using vertex partition (5) and Table 5 on the above formula, we have:
F N ( G ) = ( 4 ) ( 12 3 ) + ( 6 n 2 ) ( 15 3 ) + ( n 2 ) ( 18 3 ) + ( 4 ) ( 24 3 ) + ( 6 n 8 ) ( 27 3 ) + ( 3 n 2 9 n + 6 2 ) ( 30 3 ) = 46,332 n 2 + 16,848 n + 113,994 .
(ii)
Let G be a regular triangulene oxide network having dimension n. Using vertex partition (7) and Table 6, the general formula of the F N index gives the following computation.
F N ( G ) = ( 4 ) ( 6 3 ) + ( 3 n 2 ) ( 8 3 ) + ( 4 ) ( 12 3 ) + ( 6 n 8 ) ( 14 3 ) + ( 3 n 2 9 n + 6 2 ) ( 16 3 ) = 6144 n 2 432 n 2912 .
Hence the proof. ☐
Theorem 8.
The modified neighborhood version of the forgotten topological index ( F N ) of the regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) )) networks for n 2 is given by:
(i) 
F N ( R T S L ( n ) ) = 5400 n 2 + 28,278 n 38,394 ,
(ii) 
F N ( R T O X ( n ) ) = 1536 n 2 + 480 n 864 .
Proof. 
The general formula of the modified neighborhood version of the forgotten topological index is given by:
F N ( G ) = u v E ( G ) [ δ G ( u ) 2 + δ G ( v ) 2 ] .
(i)
Let G R T S L ( n ) . Then, applying edge partition (6) and Table 7 on the definition of the F N index, we have:
F N ( G ) = ( 2 ) ( 12 2 + 12 2 ) + ( 4 ) ( 12 2 + 15 2 ) + ( 4 ) ( 12 2 + 24 2 ) + ( 3 n 2 ) ( 15 2 + 15 2 ) + ( 10 ) ( 15 2 + 24 2 ) + ( 12 n 16 ) ( 15 2 + 27 2 ) + ( 2 ) ( 18 2 + 24 2 ) + ( 6 n 8 ) ( 18 2 + 27 2 ) + ( 10 n 24 ) ( 18 2 + 30 2 ) + ( 1 ) ( 24 2 + 24 2 ) + ( 6 ) ( 24 2 + 27 2 ) + ( 6 n 7 ) ( 27 2 + 27 2 ) + ( 6 n 12 ) ( 27 2 + 30 2 ) + 3 ( n 2 ) 2 ( 30 2 + 30 2 ) .
After simplification and arranging the terms, we can get the desired result.
(ii)
Let G R T O X ( n ) . Now, applying the edge partition (8) and Table 8 on the definition of the F N index, we have:
F N ( G ) = | E ( 6 , 6 ) | ( 6 2 + 6 2 ) + | E ( 6 , 12 ) | ( 6 2 + 12 2 ) + | E ( 8 , 12 ) | ( 8 2 + 12 2 ) + | E ( 8 , 14 ) | ( 8 2 + 14 2 ) + | E ( 12 , 12 ) | ( 12 2 + 12 2 ) + | E ( 12 , 14 ) | ( 12 2 + 14 2 ) + | E ( 14 , 14 ) | ( 14 2 + 14 2 ) + | E ( 14 , 16 ) | ( 14 2 + 16 2 ) + | E ( 16 , 16 ) | ( 16 2 + 16 2 ) = ( 2 ) ( 6 2 + 6 2 ) + ( 4 ) ( 6 2 + 12 2 ) + ( 4 ) ( 8 2 + 12 2 ) + ( 6 n 8 ) ( 8 2 + 14 2 ) ( 1 ) ( 12 2 + 12 2 ) + ( 6 ) ( 12 2 + 14 2 ) + ( 6 n 9 ) ( 14 2 + 14 2 ) + ( 6 n 12 ) ( 14 2 + 16 2 ) + ( 3 n 2 12 n + 12 ) ( 16 2 + 16 2 ) = 1536 n 2 + 480 n 864 .
Hence the theorem. ☐
Theorem 9.
The neighborhood version of the second Zagreb index ( M 2 ) of the regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) )) networks for n 2 is given by:
(i) 
M 2 ( R T S L ( n ) ) = 2700 n 2 + 12,285 n 16,713 ,
(ii) 
M 2 ( R T O X ( n ) ) = 768 n 2 + 120 n 380 .
Proof. 
The general formula of the neighborhood version of the second Zagreb index is given by:
M 2 ( G ) = u v E ( G ) [ δ G ( u ) δ G ( v ) ] .
(i)
Let G be the regular triangulene silicate network having dimension n. Applying the edge partition (6) and Table 7 on the definition of the neighborhood version of the second Zagreb index, we get the desired result as follows.
M 2 ( G ) = 2 ( 12.12 ) + 4 ( 12.15 ) + 4 ( 12.24 ) + ( 3 n 2 ) ( 15.15 ) + 10 ( 15.24 ) + ( 12 n 16 ) ( 15.27 ) + 2 ( 18.24 ) + ( 6 n 8 ) ( 18.27 ) + ( 10 n 24 ) ( 18.30 ) + 1 ( 24.24 ) + 6 ( 24.27 ) + ( 6 n 7 ) ( 27.27 ) + ( 6 n 12 ) ( 27.30 ) + 3 ( n 2 ) 2 ( 30.30 ) = 2700 n 2 + 12,285 n 16,713 .
(ii)
Let G be a regular triangulene oxide network having dimension n. Applying the edge partition (8) and Table 8, on the definition of the neighborhood version of the second Zagreb index, we get the desired result as follows.
M 2 ( G ) = 2 ( 6.6 ) + 4 ( 6.12 ) + 4 ( 8.12 ) + 2 ( 3 n 4 ) ( 8.14 ) + 1 ( 12.12 ) + 6 ( 12.14 ) + 3 ( 2 n 3 ) ( 14.14 ) + 6 ( n 2 ) ( 14.16 ) + 3 ( n 2 4 n + 4 ) ( 16.16 ) = 768 n 2 + 120 n 380 .
Hence the proof. ☐
Theorem 10.
The neighborhood version of the hyper Zagreb index ( H M N ) of the regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) )) networks for n 2 is given by:
(i) 
H M N ( R T S L ( n ) ) = 10,800 n 2 + 52,848 n 71,820 ,
(ii) 
H M N ( R T O X ( n ) ) = 3072 n 2 + 720 n 1624 .
Proof. 
The general formula of the neighborhood version of the hyper Zagreb index is given by:
H M N ( G ) = u v E ( G ) [ δ G ( u ) + δ G ( v ) ] 2 .
(i)
Let G R T S L ( n ) . Now, applying edge partition (6) and Table 7 on the definition of the H M N index, we get the following computation.
H M N ( G ) = 2 ( 12 + 12 ) 2 + 4 ( 12 + 15 ) 2 + 4 ( 12 + 24 ) 2 + ( 3 n 2 ) ( 15 + 15 ) 2 + 10 ( 15 + 24 ) 2 + ( 12 n 16 ) ( 15 + 27 ) 2 + 2 ( ( 18 + 24 ) 2 + ( 6 n 8 ) ( 18 + 27 ) 2 + ( 10 n 24 ) ( 18 + 30 ) 2 + 1 ( 24 + 24 ) 2 + 6 ( 24 + 27 ) 2 + ( 6 n 7 ) ( 27 + 27 ) 2 + ( 6 n 12 ) ( 27 + 30 ) 2 + 3 ( n 2 ) 2 ( 30 + 30 ) 2 = 10,800 n 2 + 52,848 n 71,820 .
(ii)
Let G R T O X ( n ) . Now, applying edge partition (8) and Table 8 on the definition of the H M N index, we get the following computation.
H M N ( G ) = 2 ( 6 + 6 ) 2 + 4 ( 6 + 12 ) 2 + 4 ( 8 + 12 ) 2 + ( 6 n 8 ) ( 8 + 14 ) 2 + 1 ( 12 + 12 ) 2 + 6 ( 12 + 14 ) 2 + ( 6 n 12 ) ( 14 + 16 ) 2 + ( 3 n 2 12 n + 12 ) ( 16 + 16 ) 2 = 3072 n 2 + 720 n 1624 .
Hence the theorem. ☐
Five topological indices for R T S L ( n ) and R T O X ( n ) are shown graphically in the Figure 9.

3.3. Rhombus Silicate ( R H S L ( n ) ) and Oxide ( R H O X ( n ) ) Networks

In this subsection, we obtain the five aforementioned indices for rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) ) networks. The structures of R H S L ( 3 ) and R H O X ( 3 ) are shown in Figure 10 and Figure 11, respectively. For a rhombus silicate network ( R H S L ( n ) ) having dimension n, the number of nodes and edges is 5 n 2 + 2 n and 12 n 2 , respectively [21]. For a rhombus oxide network ( R H O X ( n ) ) having dimension n, the number of nodes and edges is 3 n 2 + 2 n and 6 n 2 , respectively [21,26]. The vertex and edge partitions of the rhombus silicate network are as follows.
V ( R H S L ( n ) ) = V 12 V 15 V 18 V 24 V 27 V 30 ,
E ( R H S L ( n ) ) = E ( 12 , 12 ) E ( 12 , 24 ) E ( 15 , 24 ) E ( 18 , 24 ) E ( 24 , 27 ) E ( 15 , 15 ) E ( 18 , 27 ) E ( 27 , 27 ) E ( 15 , 27 ) E ( 27 , 30 ) E ( 18 , 30 ) E ( 30 , 30 ) .
The vertex and edge partitions of the rhombus oxide network are as follows.
V ( R H O X ( n ) ) = V 6 V 8 V 12 V 14 V 16 ,
E ( R H O X ( n ) ) = E ( 6 , 6 ) E ( 6 , 12 ) E ( 8 , 12 ) E ( 8 , 14 ) E ( 12 , 14 ) E ( 14 , 14 ) E ( 14 , 16 ) E ( 16 , 16 ) .
Theorem 11.
The neighborhood Zagreb index ( M N ) of the rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) )) networks for n 2 is given by:
(i) 
M N ( R H S L ( n ) ) = 1548 n 2 + 3636 n 4932 ,
(ii) 
M N ( R H O X ( n ) ) = 768 n 2 736 n + 2048 .
Proof. 
(i)
Let G R H S L ( n ) . Now, applying vertex partition (9) and Table 9 on the definition of the neighborhood Zagreb index, we obtain:
M N ( G ) = | V 12 | ( 12 2 ) + | V 15 | ( 15 2 ) + | V 18 | ( 18 2 ) + | V 24 | ( 24 2 ) + | V 27 | ( 27 2 ) + | V 30 | ( 30 2 ) = 6 ( 12 2 ) + 8 ( n 1 ) ( 15 2 ) + 2 ( n 1 ) 2 ( 18 2 ) + ( 4 ) ( 24 2 ) + ( 8 n 12 ) ( 27 2 ) + ( n 2 ) ( n 1 ) ( 30 2 ) = 768 n 2 736 n + 2048 .
(ii)
Let G R H O X ( n ) . Now, using vertex partition (11) and Table 10 on the definition of the neighborhood Zagreb index, we obtain:
M N ( G ) = | V 6 | ( 6 2 ) + | V 8 | ( 8 2 ) + | V 12 | ( 12 2 ) + | V 14 | ( 14 2 ) + | V 16 | ( 16 2 ) = 4 ( 6 2 ) + 4 ( n 1 ) ( 8 2 ) + 4 ( 12 2 ) + ( 8 n 12 ) ( 14 2 ) + ( 3 n 2 10 n + 8 ) ( 16 2 ) .
After simplifying and arranging the terms, the required result can be obtained easily.
Hence the proof. ☐
Theorem 12.
The neighborhood version of the forgotten topological index ( F N ) of the rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) )) networks for n 2 is given by:
(i) 
F N ( R H S L ( n ) ) = 38,664 n 2 + 80,136 n 131,868 ,
(ii) 
F N ( R H O X ( n ) ) = 12,288 n 2 16,960 n + 5568 .
Proof. 
(i)
Let G R H S L ( n ) . Using vertex partition (9) and Table 9 on the above formula, we have:
F N ( G ) = 6 ( 12 3 ) + 8 ( n 1 ) ( 15 3 ) + 2 ( n 1 ) 2 ( 18 3 ) + ( 4 ) ( 24 3 ) + ( 8 n 12 ) ( 27 3 ) + ( n 2 ) ( n 1 ) ( 30 3 ) .
After simplification and arranging the terms, the required result is obtained.
(ii)
Let G R H O X ( n ) . Using vertex partition (11) and Table 10, the general formula of the F N index gives the following computation.
F N ( G ) = 4 ( 6 3 ) + 4 ( n 1 ) ( 8 3 ) + 4 ( 12 3 ) + ( 8 n 12 ) ( 14 3 ) + ( 3 n 2 10 n + 8 ) ( 16 3 ) . = 768 n 2 736 n + 2048 .
Hence the proof. ☐
Theorem 13.
The modified neighborhood version of the forgotten topological index ( F N ) of the rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) )) networks for n 2 is given by:
(i) 
F N ( R H S L ( n ) ) = 18,144 n 2 17,496 n + 5472 ,
(ii) 
F N ( R H O X ( n ) ) = 3072 n 2 3456 n + 712 .
Proof. 
The general formula of the modified neighborhood version of the forgotten topological index is given by:
F N ( G ) = u v E ( G ) [ δ G ( u ) 2 + δ G ( v ) 2 ] .
(i)
Let G R H S L ( n ) . Then, applying vertex partition (10) and Table 11 on the definition of the F N index, we have:
F N ( G ) = 6 ( 12 2 + 12 2 ) + 6 ( 12 2 + 24 2 ) + 8 ( 15 2 + 24 2 ) + 2 ( 18 2 + 24 2 ) + 8 ( 24 2 + 27 2 ) + 4 ( n 1 ) ( 15 2 + 15 2 ) + 4 ( 2 n 3 ) ( 18 2 + 27 2 ) + 8 ( n 2 ) + 2 ( 27 2 + 27 2 ) + 8 ( 2 n 3 ) ( 15 2 + 27 2 ) + 8 ( n 2 ) ( 27 2 + 30 2 ) + 2 ( n 2 ) ( 3 n 4 ) ( 18 2 + 30 2 ) + 6 ( n 2 ) 2 ( 30 2 + 30 2 ) = 18,144 n 2 17,496 n + 5472 .
(ii)
Let G R H O X ( n ) . Now, applying the vertex partition (12) and the Table 12 on the definition of the F N index, we have:
F N ( G ) = 2 ( 6 2 + 6 2 ) + 4 ( 6 2 + 12 2 ) + 4 ( 8 2 + 12 2 ) + 4 ( 2 n 3 ) ( 8 2 + 14 2 ) + 8 ( 12 2 + 14 2 ) + 2 ( 4 n 7 ) ( 14 2 + 14 2 ) + 8 ( n 2 ) ( 14 2 + 16 2 ) + 6 ( n 2 ) 2 ( 16 2 + 16 2 ) = 3072 n 2 3456 n + 712 .
Hence the theorem. ☐
Theorem 14.
The neighborhood versions of the second Zagreb index ( M 2 ) of the rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) )) networks for n 2 are given by:
(i) 
M 2 ( R H S L ( n ) ) = 8640 n 2 8820 n + 2142 ,
(ii) 
M 2 ( R H O X ( n ) ) = 1536 n 2 1888 n 784 .
Proof. 
(i)
Let G be the rhombus-type silicate network having dimension n. Applying the edge partition (10) and Table 11,on the definition of the neighborhood version of the second Zagreb index, we get the desired result as follows.
M 2 ( G ) = 6 ( 12.12 ) + 6 ( 12.24 ) + 8 ( 15.24 ) + 2 ( 18.24 ) + 8 ( 24.27 ) + 4 ( n 1 ) ( 15.15 ) + 4 ( 2 n 3 ) ( 18.27 ) + ( ( n 2 ) + 2 ) ( 27.27 ) + 8 ( 2 n 3 ) ( 15.27 ) + 8 ( n 2 ) ( 27.30 ) + 2 ( n 2 ) ( 3 n 4 ) ( 18.30 ) + 6 ( n 2 ) 2 ( 30.30 ) = 8640 n 2 8820 n + 2142 .
(ii)
Let G be the rhombus-type oxide network having dimension n. Applying the edge partition (12) and Table 12 on the definition of the neighborhood version of the second Zagreb index, we get the desired result as follows.
M 2 ( G ) = 2 ( 6.6 ) + 4 ( 6.12 ) + 4 ( 8.12 ) + 4 ( 2 n 3 ) ( 8.14 ) + 8 ( 12.14 ) + 2 ( 4 n 7 ) ( 14.14 ) + 8 ( n 2 ) ( 14.16 ) + 6 ( n 2 ) 2 ( 16.16 ) = 1536 n 2 1888 n 784 .
 ☐
Theorem 15.
The neighborhood versions of the hyper Zagreb index ( H M N ) of the rhombus silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) )) networks for n 2 are given by:
(i) 
H M N ( R H S L ( n ) ) = 35,424 n 2 35,136 n + 7956 ,
(ii) 
H M N ( R H O X ( n ) ) = 6144 n 2 7232 n + 1984 .
Proof. 
(i)
Let G R H S L ( n ) . Now, applying edge partition (10) and Table 11, on the definition of the H M N index, we get the following computation.
H M N ( G ) = 6 ( 12 + 12 ) 2 + 6 ( 12 + 24 ) 2 + ( 4 n 4 ) ( 15 + 15 ) 2 + 8 ( 15 + 24 ) 2 + ( 16 n 24 ) ( 15 + 27 ) 2 + 2 ( 18 + 24 ) 2 + ( 8 n 12 ) ( 18 + 27 ) 2 + 2 ( n 2 ) ( 3 n 4 ) ( 18 + 30 ) 2 + ( 8 n 14 ) ( 27 + 27 ) 2 + ( 8 n 16 ) ( 27 + 30 ) 2 + 6 ( n 2 ) 2 ( 30 + 30 ) 2 = 35,424 n 2 35,136 n + 7956 .
(ii)
Let G R H O X ( n ) . Now, applying edge partition (12) and Table 12 on the definition of the H M N index, we get the following computation.
H M N ( G ) = 2 ( 6 + 6 ) 2 + 4 ( 6 + 12 ) 2 + 4 ( 8 + 12 ) 2 + ( 8 n 12 ) ( 8 + 14 ) 2 + 8 ( 12 + 14 ) 2 + ( 8 n 14 ) ( 14 + 14 ) 2 + ( 8 n 16 ) ( 14 + 16 ) 2 + 6 ( n 2 ) 2 ( 16 + 16 ) 2 = 6144 n 2 7232 n + 1984 .
Hence the theorem. ☐
The five topological indices for R H S L ( n ) and R H O X ( n ) are shown graphically in Figure 12.

3.4. Copper (II) Oxide

We obtain topological indices for copper (II) oxide ( C u O ) here. Its molecular graph is depicted in Figure 13. In the C u O structure, the octagons are linked to each other in columns and rows. The connection between two octagons is achieved by creating one C 4 bond between two octagons. It contains 4 m n + 3 n + m nodes and 6 m n + 2 n edges, where m and n represent the number of octagons in rows and columns, respectively [22]. The vertex and edge partitions of the copper oxide network are as follows.
V ( C u O ) = V 4 V 5 V 6 V 10 V 12 ,
E ( C u O ) = E ( 4 , 4 ) E ( 4 , 5 ) E ( 4 , 6 ) E ( 5 , 6 ) E ( 6 , 6 ) E ( 6 , 10 ) E ( 10 , 10 ) E ( 10 , 12 ) .
Theorem 16.
The neighborhood Zagreb index ( M N ) of copper oxide ( C u O ) for m , n > 2 is given by:
M N ( C u O ) = 380 m n 200 m 148 n + 92 .
Proof. 
The general formula of the neighborhood Zagreb index is given by:
M N ( G ) = v V ( G ) δ G ( v ) 2 .
Let G be a copper oxide network having m rows and n columns. Now, applying vertex partition (13) and Table 13 on the definition of the neighborhood Zagreb index, we get:
M N ( G ) = | V 4 | ( 4 2 ) + | V 5 | ( 5 2 ) + | V 6 | ( 6 2 ) + | V 10 | ( 10 2 ) + | V 12 | ( 12 2 ) = ( 2 n + 4 ) ( 4 2 ) + 4 ( 5 2 ) + ( m n + 4 m + 3 n 10 ) ( 6 2 ) + ( 2 m n 2 m ) ( 10 2 ) + ( m n m 2 n + 2 ) ( 12 2 ) = 380 m n 200 m 148 n + 92 .
Hence the proof. ☐
Theorem 17.
The neighborhood version of the forgotten topological index ( F N ) of copper oxide ( C u O ) for m , n > 2 is given by:
F N ( C u O ) = 3944 m n 2864 m 2680 n + 2052 .
Proof. 
Applying vertex partition (13) and Table 13 on the definition of the neighborhood version of the forgotten topological index, the required result can be obtained easily like the previous proof. ☐
Theorem 18.
The modified neighborhood version of the forgotten topological index ( F N ) of copper oxide ( C u O ) for m , n > 2 is given by:
F N ( C u O ) = 1248 m n 816 m 672 n + 508 .
Proof. 
Let G be a copper oxide network with m rows and n columns. Now, by the edge partition (14) and Table 14, we have from the general formulation of F N the following.
F N ( G ) = | E ( 4,4 ) | ( 4 2 + 4 2 ) + | E ( 4,5 ) | ( 4 2 + 5 2 ) + | E ( 4,6 ) | ( 4 2 + 6 2 ) + | E ( 5,6 ) | ( 5 2 + 6 2 ) + | E ( 6,6 ) | ( 6 2 + 6 2 ) + | E ( 6 , 10 ) | ( 6 2 + 10 2 ) + | E ( 10,10 ) | ( 10 2 + 10 2 ) + | E ( 10 , 12 ) | ( 10 2 + 12 2 ) = ( 4 ) ( 4 2 + 4 2 ) + ( 4 ) ( 4 2 + 5 2 ) + ( 4 n 4 ) ( 4 2 + 6 2 ) + ( 4 ) ( 5 2 + 6 2 ) + ( 6 m 10 ) ( 6 2 + 6 2 ) + ( 2 m n 2 m + 2 n 2 ) ( 6 2 + 10 2 ) + ( 4 n 4 ) ( 10 2 + 10 2 ) + ( 4 m n 4 m 8 n + 8 ) ( 10 2 + 12 2 ) .
The required result is obvious after simplification. ☐
Theorem 19.
The neighborhood version of the second Zagreb index ( M 2 ) of copper oxide ( C u O ) for m , n > 2 is given by:
M 2 ( C u O ) = 600 m n 384 m 344 n + 248 .
Proof. 
Applying edge partition (14) and Table 14 on the the general formula of the M 2 index, the required result can be obtained easily like the previous proof. ☐
Theorem 20.
The neighborhood version of the hyper Zagreb index ( H M N ) of copper oxide ( C u O ) for m , n > 2 is given by:
H M N ( C u O ) = 2448 m n 1584 m 1360 n + 984 .
Proof. 
Applying edge partition (14) and Table 14 on the the general formula of the M 2 index, the required result follows in the same way as before. ☐
The five topological indices for C u O are depicted graphically in Figure 14, Figure 15 and Figure 16.

4. Remarks and Conclusions

In this work, we derived some explicit expressions of five topological indices, namely the neighborhood Zagreb index ( M N ), the neighborhood version of the forgotten topological index ( F N ), the modified neighborhood version of the forgotten topological index ( F N ), the neighborhood version of the second Zagreb index ( M 2 ), and the neighborhood version of the hyper Zagreb index ( H M N ), for dominating silicate ( D S L ( n ) ) and oxide ( D O X ( n ) ) networks, regular triangulene silicate ( R T S L ( n ) ) and oxide ( R T O X ( n ) ) networks, rhombus-shaped silicate ( R H S L ( n ) ) and oxide ( R H O X ( n ) ) networks, and the copper oxide ( C u O ) network. Furthermore, we made a comparison graphically among all indices for the above-mentioned networks. The comparison was made in Figure 6, Figure 9, Figure 12, and Figure 16. The aforementioned indices were very close at the initial stage of the given domain and then grew. Among the five topological indices, the neighborhood version of the forgotten topological index ( F N ) had the most dominating power in comparison with the other indices. The neighborhood Zagreb index ( M N ) grew more slowly than the other indices. The nature of the neighborhood version of the second Zagreb index ( M 2 ) was close to the F N index. In comparison to other networks, the H M N index was close to the F N index in R T S L ( n ) . In R T S L ( n ) , the gap between the F n and H M N indices was more than the other networks. From the vertical axis, it was clear that the indices for different networks grew in the following order:
C u O < R T O X ( n ) < R H O X ( n ) < R H S L ( n ) < R T S L ( n ) < D O X ( n ) < D S L ( n ) ,
where in each case, the indices had the following order:
M N < M 2 < F N < H M N < F N ,
i.e., all the indices behaved differently in each network discussed above. This work will help researchers working in network science understand the topology of the aforementioned networks. In the future, we would like to obtain these indices for some other chemical networks, trees, dendrimers, etc.

Author Contributions

Conceptualization, N.D.; Methodology, N.D., S.M.; Writing-Original Draft Preparation, N.D., S.M. and A.P.; Writing-Review and Editing, N.D., S.M. and A.P.; Supervision, N.D., A.P.; Project Administration, A.P.

Funding

This research was funded by the Department of Science and Technology (DST), the Government of India (Inspire Fellowship [IF170148]).

Acknowledgments

We acknowledge the anonymous reviewers for their important comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Borkow, G. Safety of Using Copper Oxide in Medical Devices and Consumer Products. Cur. Chem. Biol. 2012, 6, 86–92. [Google Scholar]
  2. Trinajstić, N. Chemical Graph Theory; CRC Press: Boca Raton, FL, USA, 1983. [Google Scholar]
  3. Gutman, I.; Polansky, O.E. Mathematical Concepts in Organic Chemistry; Springer: Berlin, Germany, 1986. [Google Scholar]
  4. Diudea, M.V.; Gutman, I.; Lorentz, J. Molecular Topology; Babes-Bolyai University: Cluj-Napoca, Romania, 2001. [Google Scholar]
  5. Wiener, H. Structural determination of the paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
  6. Gutman, I.; Trinajstić, N. Graph theory and molecular orbitals. Total π-electron energy of alternate hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
  7. Furtula, B.; Gutman, I. Forgotten topological index. J. Math. Chem. 2015, 53. [Google Scholar] [CrossRef]
  8. Shirdel, G.H.; Rezapour, H.; Sayadi, A.M. The hyper Zagreb index of graph operations. Iran. J. Math. Chem. 2013, 4, 213–220. [Google Scholar]
  9. Mondal, S.; De, N.; Pal, A. The Neighborhood Zagreb index of product graphs and its chemical interest. arXiv 2018, arXiv:1805.05273. [Google Scholar]
  10. Mondal, S.; De, N.; Pal, A. On some new neighborhood degree based indices. Acta Chem. IASI 2019. Accepted. [Google Scholar]
  11. Aslam, A.; Bashir, Y.; Ahmed, S.; Gao, W. On topological indices of certain dendrimer structures. Z. Naturforsch. 2017, 72, 559–566. [Google Scholar] [CrossRef]
  12. Imran, M.; Siddiqui, M.K.; Abunamous, A.A.E.; Adi, D.S.; Rafique, H.; Baig, A.Q. Eccentricity Based Topological Indices of an Oxide Network. Mathematics 2018, 6, 126. [Google Scholar] [CrossRef]
  13. De, N. On Molecular Topological Properties of TiO2 Nanotubes. J. Nanosci. 2016. [Google Scholar] [CrossRef]
  14. Bashir, Y.; Aslam, A.; Kamran, M.; Qureshi, M.I.; Jahangir, A.; Rafiq, M.; Bibi, N.; Muhammad, N. On Forgotten Topological Indices of Some Dendrimers Structure. Molecules 2017, 22, 867. [Google Scholar] [CrossRef]
  15. Akhter, S.; Imran, M.; Gao, W.; Farahani, M.R. On topological indices of honeycomb networks and graphene networks. Hacet. J. Math. Stat. 2018, 47, 19–35. [Google Scholar] [CrossRef]
  16. Kwun, Y.C.; Ahmad, J.; Nazeer, W.; Khalid, W.; Kang, S.M. Topological invariants of molecular graph of Graphene. JP J. Geom. Topol. 2018, 21, 95–103. [Google Scholar] [CrossRef]
  17. Jagadeesh, R.; Khanna, M.R.R.; Indumathi, R.S. Some results on topological indices of graphene. Nanomater. Nanotechnol. 2016, 6, 1–6. [Google Scholar]
  18. Akhtar, S.; Imran, M. On molecular topological properties of benzenoid structures. Can. J. Chem. 2016, 94, 687–698. [Google Scholar] [CrossRef] [Green Version]
  19. Shegehalli, V.S.; Kanabur, R. Computation of New Degree-Based Topological Indices of Graphene. J. Math. 2016, 2016, 4341919. [Google Scholar] [CrossRef]
  20. 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]
  21. Javaid, M.; Rehman, M.U.; Cao, J. Topological indices of rhombus type silicate and oxide networks. Can. J. Chem. 2017, 95, 134–143. [Google Scholar] [CrossRef] [Green Version]
  22. Gao, W.; Baig, A.Q.; Khalid, W.; Farahani, M.R. Molecular description of copper(II) oxide. Maced. J. Chem. Chem. Eng. 2017, 36, 93–99. [Google Scholar] [Green Version]
  23. Gao, W.; Siddiqui, M.K. Molecular Descriptors of Nanotube, Oxide, Silicate, and Triangulene Networks. J. Chem. 2017. [Google Scholar] [CrossRef]
  24. Rajan, B.; William, A.; Grigorious, C.; Stephen, S. On Certain Topological Indices of Silicate, Honeycomb and Hexagonal Networks. J. Comput. Math. Sci. 2012, 3, 530–535. [Google Scholar]
  25. Ghorbani, M.; Hosseinzadeh, M.A. The third version of Zagreb index. Discret. Math. Algorithms Appl. 2013, 5. [Google Scholar] [CrossRef]
  26. Simonraj, F.; George, A. Topological Properties of few Poly Oxide, Poly Silicate, DOX and DSL Networks. Int. J. Future Comput. Commun. 2013, 2. [Google Scholar] [CrossRef]
Figure 1. Silicate tetrahedra ( S i O 4 ).
Figure 1. Silicate tetrahedra ( S i O 4 ).
J 02 00026 g001
Figure 2. Linear fitting of five topological indices with entropy and the acentric factor.
Figure 2. Linear fitting of five topological indices with entropy and the acentric factor.
J 02 00026 g002
Figure 3. Honeycomb network H C ( 3 ) of dimension three.
Figure 3. Honeycomb network H C ( 3 ) of dimension three.
J 02 00026 g003
Figure 4. Dominating silicate network ( D S L ( 3 ) ).
Figure 4. Dominating silicate network ( D S L ( 3 ) ).
J 02 00026 g004
Figure 5. Dominating oxide network ( D O X ( 3 ) ).
Figure 5. Dominating oxide network ( D O X ( 3 ) ).
J 02 00026 g005
Figure 6. Different topological indices for dominating (a) silicate and (b) oxide networks.
Figure 6. Different topological indices for dominating (a) silicate and (b) oxide networks.
J 02 00026 g006
Figure 7. Regular triangulene silicate network ( R T S L ( 5 ) ).
Figure 7. Regular triangulene silicate network ( R T S L ( 5 ) ).
J 02 00026 g007
Figure 8. Regular triangulene oxide network ( R T O X ( 5 ) ).
Figure 8. Regular triangulene oxide network ( R T O X ( 5 ) ).
J 02 00026 g008
Figure 9. Different topological indices for regular triangulene (a) silicate and (b) oxide networks.
Figure 9. Different topological indices for regular triangulene (a) silicate and (b) oxide networks.
J 02 00026 g009
Figure 10. Rhombus-type silicate network ( R H S L ( 3 ) ).
Figure 10. Rhombus-type silicate network ( R H S L ( 3 ) ).
J 02 00026 g010
Figure 11. Rhombus-type oxide network ( R H O X ( 3 ) ).
Figure 11. Rhombus-type oxide network ( R H O X ( 3 ) ).
J 02 00026 g011
Figure 12. Different topological indices for rhombus-type (a) silicate and (b) oxide network.
Figure 12. Different topological indices for rhombus-type (a) silicate and (b) oxide network.
J 02 00026 g012
Figure 13. Copper oxide ( C u O ) network with five rows and four columns.
Figure 13. Copper oxide ( C u O ) network with five rows and four columns.
J 02 00026 g013
Figure 14. (a) The M N index and (b) the F N index of the copper oxide network.
Figure 14. (a) The M N index and (b) the F N index of the copper oxide network.
J 02 00026 g014
Figure 15. (a) The F N index, (b) the M 2 index, and (c) the H M N index of the copper oxide network.
Figure 15. (a) The F N index, (b) the M 2 index, and (c) the H M N index of the copper oxide network.
J 02 00026 g015
Figure 16. Different topological indices for the copper oxide network.
Figure 16. Different topological indices for the copper oxide network.
J 02 00026 g016
Table 1. Vertex partition of dominating silicate networks ( D S L ( n ) ) with dimension n.
Table 1. Vertex partition of dominating silicate networks ( D S L ( n ) ) with dimension n.
V i V 15 V 18 V 24 V 27 V 30
| V i | 24 n 12 18 n 2 30 n + 12 6 n 12 ( n 1 ) 27 n 2 51 n + 24
Table 2. Vertex partition of dominating oxide networks ( D O X ( n ) ) with dimension n.
Table 2. Vertex partition of dominating oxide networks ( D O X ( n ) ) with dimension n.
V i V 8 V 12 V 14 V 16
| V i | 12 n 6 6 n 12 ( n 1 ) 27 n 2 51 n + 24
Table 3. Edge partition of dominating silicate networks ( D S L ( n ) ) with dimension n.
Table 3. Edge partition of dominating silicate networks ( D S L ( n ) ) with dimension n.
E ( p , q ) E ( 15,15 ) E ( 15,24 ) E ( 15,27 ) E ( 18,27 ) E ( 18,30 ) E ( 24,24 ) E ( 24,27 ) E ( 27,30 ) E ( 30,30 )
| E ( p , q ) | 6 ( 2 n 1 ) 24 n 24 ( n 1 ) 12 ( n 1 ) 54 n 2 102 n + 48 6 12 ( n 1 ) 24 ( n 1 ) 54 n 2 114 n + 60
Table 4. Edge partition of dominating oxide networks ( D O X ( n ) ) with dimension n.
Table 4. Edge partition of dominating oxide networks ( D O X ( n ) ) with dimension n.
E ( p , q ) E ( 8,12 ) E ( 8,14 ) E ( 12,12 ) E ( 12,14 ) E ( 14,16 ) E ( 16,16 )
| E ( p , q ) | 12 n 12 ( n 1 ) 6 12 ( n 1 ) 24 ( n 1 ) 54 n 2 114 n + 60
Table 5. Vertex partition of regular triangulene silicate networks ( R T S L ( n ) ) with dimension n.
Table 5. Vertex partition of regular triangulene silicate networks ( R T S L ( n ) ) with dimension n.
V i V 12 V 15 V 18 V 24 V 27 V 30
| V i | 4 6 n 2 n 2 4 6 n 8 3 n 2 9 n + 6 2
Table 6. Vertex partition of regular triangulene oxide networks ( R T O X ( n ) ) with dimension n.
Table 6. Vertex partition of regular triangulene oxide networks ( R T O X ( n ) ) with dimension n.
V i V 6 V 8 V 12 V 14 V 16
| V i | 4 3 n 2 4 6 n 8 3 n 2 9 n + 6 2
Table 7. Edge partition of regular triangulene silicate networks ( R T S L ( n ) ) with dimension n.
Table 7. Edge partition of regular triangulene silicate networks ( R T S L ( n ) ) with dimension n.
E ( p , q ) E ( 12,12 ) E ( 12,15 ) E ( 12,24 ) E ( 15,15 ) E ( 15,24 ) E ( 15,27 ) E ( 18,24 ) E ( 18,27 ) E ( 18,30 ) E ( 24,24 ) E ( 24,27 ) E ( 27,27 ) E ( 27,30 ) E ( 30,30 )
| E ( p , q ) | 244 3 n 2 10 12 n 16 2 6 n 8 10 n 24 16 6 n 7 6 n 12 3 ( n 2 ) 2
Table 8. Edge partition of regular triangulene oxide networks ( R T O X ( n ) ) with dimension n.
Table 8. Edge partition of regular triangulene oxide networks ( R T O X ( n ) ) with dimension n.
E ( p , q ) E ( 6,6 ) E ( 6,12 ) E ( 8,12 ) E ( 8,14 ) E ( 12,12 ) E ( 12,14 ) E ( 14,14 ) E ( 14,16 ) E ( 16,16 )
| E ( p , q ) | 244 6 n 8 16 6 n 9 6 n 12 3 n 2 12 n + 12
Table 9. Vertex partition of rhombus silicate networks ( R H S L ( n ) ) with dimension n.
Table 9. Vertex partition of rhombus silicate networks ( R H S L ( n ) ) with dimension n.
V i V 12 V 15 V 18 V 24 V 27 V 30
| V i | 6 8 ( n 1 ) 2 ( n 1 ) 2 4 8 n 12 ( n 2 ) ( n 1 )
Table 10. Vertex partition of rhombus oxide networks ( R H O X ( n ) ) with dimension n.
Table 10. Vertex partition of rhombus oxide networks ( R H O X ( n ) ) with dimension n.
V i V 6 V 8 V 12 V 14 V 16
| V i | 4 4 ( n 1 ) 4 8 n 12 3 n 2 10 n + 8
Table 11. Edge partition of rhombus silicate networks ( R H S L ( n ) ) with dimension n.
Table 11. Edge partition of rhombus silicate networks ( R H S L ( n ) ) with dimension n.
E ( p , q ) E ( 12,12 ) E ( 12,24 ) E ( 15,24 ) E ( 15,27 ) E ( 18,24 ) E ( 18,27 ) E ( 24,27 ) E ( 15,15 ) E ( 27,27 ) E ( 27,30 ) E ( 18,30 ) E ( 30,30 )
| E ( p , q ) | 668 8 ( 2 n 3 ) 2 4 ( 2 n 3 ) 8 4 ( n 1 ) 8 ( n 2 ) + 2 8 ( n 2 ) 2 ( n 2 ) ( 3 n 4 ) 6 ( n 2 ) 2
Table 12. Edge partition of rhombus oxide networks ( R H O X ( n ) ) with dimension n.
Table 12. Edge partition of rhombus oxide networks ( R H O X ( n ) ) with dimension n.
E ( p , q ) E ( 6,6 ) E ( 6,12 ) E ( 8,12 ) E ( 8,14 ) E ( 12,14 ) E ( 14,14 ) E ( 14,16 ) E ( 16,16 )
| E ( p , q ) | 244 4 ( 2 n 3 ) 8 2 ( 4 n 7 ) 8 ( n 2 ) 6 ( n 2 ) 2
Table 13. Vertex partition of copper oxide ( C u O ) with m rows and n columns.
Table 13. Vertex partition of copper oxide ( C u O ) with m rows and n columns.
V i V 4 V 5 V 6 V 10 V 12
| V i | 2 n + 4 4 m n + 4 m + 3 n 10 2 m n 2 m m n m 2 n + 2
Table 14. Edge partition of copper oxide ( C u O ) with m rows and n columns.
Table 14. Edge partition of copper oxide ( C u O ) with m rows and n columns.
E ( p , q ) E ( 4,4 ) E ( 4,5 ) E ( 4,6 ) E ( 5,6 ) E ( 6,6 ) E ( 6,10 ) E ( 10,10 ) E ( 10,12 )
| E ( p , q ) | 44 4 n 4 4 6 m 10 2 m n 2 m + 2 n 2 4 n 4 4 m n 4 m 8 n + 8

Share and Cite

MDPI and ACS Style

Mondal, S.; De, N.; Pal, A. On Some New Neighborhood Degree-Based Indices for Some Oxide and Silicate Networks. J 2019, 2, 384-409. https://doi.org/10.3390/j2030026

AMA Style

Mondal S, De N, Pal A. On Some New Neighborhood Degree-Based Indices for Some Oxide and Silicate Networks. J. 2019; 2(3):384-409. https://doi.org/10.3390/j2030026

Chicago/Turabian Style

Mondal, Sourav, Nilanjan De, and Anita Pal. 2019. "On Some New Neighborhood Degree-Based Indices for Some Oxide and Silicate Networks" J 2, no. 3: 384-409. https://doi.org/10.3390/j2030026

Article Metrics

Back to TopTop