Next Article in Journal
Cross-Sectorial Semantic Model for Support of Data Analytics in Process Industries
Next Article in Special Issue
Advantages of Utilizing Population Balance Modeling of Crystallization Processes for Particle Size Distribution Prediction of an Active Pharmaceutical Ingredient
Previous Article in Journal
Co3O4/g-C3N4 Hybrids for Gas-Phase Hg0 Removal at Low Temperature
Previous Article in Special Issue
Thermodynamic vs. Kinetic Basis for Polymorph Selection
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Molecular Descriptors of Face-Centered Cubic Lattice

1
School of Information Science and Engineering, Chengdu University, Chengdu 610106, China
2
Department of Mathematics, COMSATS University Islamabad, Lahore Campus 54000, Pakistan
3
Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus 57000, Pakistan
*
Author to whom correspondence should be addressed.
Processes 2019, 7(5), 280; https://doi.org/10.3390/pr7050280
Submission received: 10 April 2019 / Revised: 25 April 2019 / Accepted: 26 April 2019 / Published: 13 May 2019
(This article belongs to the Special Issue Modeling and Control of Crystallization)

Abstract

:
Face-centered cubic lattice F C C ( n ) has received extensive consideration as of late, inferable from its recognized properties and non-poisonous nature, minimal effort, plenitude, and basic creation process. The graph of a face-centered cubic cross-section contains cube points and face centres. A topological index of a molecular graph G is a numeric amount identified with G, which depicts its topological properties. In this paper, using graph theory tools, we computed the molecular descriptors (topological indices)—to be specific, Zagreb-type indices, a forgotten index, a Balaban index, the fourth version of an atom–bond connectivity index, and the fifth version of a geometric arithmetic index for face-centered cubic lattice F C C ( n ) .

1. Introduction

Chemical graph theory is a branch of numerical science in which we apply apparatuses of a diagram hypothesis to demonstrate the compound marvel scientifically. This hypothesis contributes noticeably in the fields of chemical sciences. Through its assistance, some physical properties, e.g., the breaking point, can be anticipated in view of the structure of the atoms. Numerical and computational strategies are effectively used to display and foresee the structure of the issue at nuclear level [1]. The structures of atoms, from a numerical perspective, are graphs. Graph theory is utilized as part of relatively every field of science, and it is likewise vigorously utilized as a part of training, both for recreations and designing arrangements [2,3,4].
Each structural formula that incorporates covalent bonded compounds or atoms is a diagram. Thus, these are called molecular graphs or basic diagrams or, perhaps more accurately, constitutional graphs. In chemistry, graph theory provides the basis for the definition, numeration, systematization of the issue closeby, it paves the way toward organizing laws or standards as per a framework or arranging terminology, and it provides the association between compounds or atoms, and PC programming. The significance of graph theory for science can be found in the presence of isomerism, which is supported by chemical graph theory [5,6].
As a result, it was recently noted that topological indices are utilized for bringing together QSAR models with numerous objectives, such as for DNA examination, to consider protein successions, for 2D RNA structures, to examine sedate–protein or medication–RNA quantitative structure-restricting relationships (QSBR), to encode protein surface data, and for protein association systems (PINs) [7,8,9].
A graph G ( V , E ) is a collection of two sets, namely vertex set V and edge set E. For a graph G, the level of a vertex v is the quantity of edge episodes to v and signified by ξ ( v ) . A subatomic chart is a hydrogen-exhausted synthetic structure in which vertices signify iotas and edges indicate the bonds.
The possibility of a topological index came to light through the work of Wiener [10], while he was managing the limit of paraffin. He named this rundown the Wiener index. The Wiener index is the first and most thought-out topological file, both from a theoretical point of view and applications, and described as the entire of partitions between all arrangements of vertices in G; for further information, see [11].
Ghorbani and Azimi [12] defined the first and second multiple Zagreb index of a graph G as:
P M 1 ( G ) = w y E ( G ) [ ξ ( w ) + ξ ( y ) ] ,
P M 2 ( G ) = w y E ( G ) [ ξ ( w ) × ξ ( y ) ] .
The first Zagreb index was presented by Gutman and Trinajstic in [13,14]. Taken after by the first and second Zagreb indices, Furtula and Gutman [15] presented the forgotten topological index as:
F ( G ) = w y E ( G ) ξ ( w ) 2 + ξ ( y ) 2 .
Gutman et al. argue that the prescient capacity, acentric factor, and entropy of the forgotten topological index are practically like those of thr first Zagreb index, and the correlation coefficients between these two are bigger than 0.95. Thus, the forgotten topological index is helpful to test the compound and pharmacological properties of medication subatomic structures. Sun et al. (2014) found some essential type of the forgotten topological index and announced that such an index can fortify the physicochemical flexibility of Zagreb indices. Recently, Gao et al. [16] showed the forgotten topological index of some noteworthy medication atomic structures.
Urtula [17] et al. introduced an augmented Zagreb index as:
A Z I ( G ) = w y E ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3 .
Another topological index based on the vertex degree is the Balaban index [18,19]. This index for a graph G of order n, size m is defined as:
J ( G ) = m m n + 2 w y E ( G ) 1 ξ ( w ) ξ ( y ) .
The redefined versions of the Zagreb indices were defined by Ranjini et al. [20], namely, the redefined first, second, and third Zagreb index for a graph G as:
R e Z G 1 ( G ) = w y E ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) ,
R e Z G 2 ( G ) = w y E ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) ,
R e Z G 3 ( G ) = w y E ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) .
Fath-Tabar [21] defined the first Zagreb polynomial and second Zagreb polynomial of a graph G as:
M 1 ( G , x ) = w y E ( G ) x [ ξ ( w ) + ξ ( y ) ] ,
M 2 ( G , x ) = w y E ( G ) x [ ξ ( w ) × ξ ( y ) ] .
In 2017, Chaluvaraju et al. [22] defined the first and second hyper-Zagreb polynomials of a graph G as:
H M 1 ( G , x ) = w y E ( G ) x [ ξ ( w ) + ξ ( y ) ] 2 ,
H M 2 ( G , x ) = w y E ( G ) x [ ξ ( w ) × ξ ( y ) ] 2 .
The fourth version of the atom–bond connectivity index A B C 4 of a graph G was introduced by Ghorbhani et al. [23]. It was defined as:
A B C 4 ( G ) = w y E ( G ) S w + S y 2 S w S y .
Another molecular descriptor is the fifth version of the geometric arithmetic index G A 5 of a graph G, introduced by Graovoc et al. [24]. It was defined as:
G A 5 ( G ) = w y E ( G ) 2 S w S y S w + S y ,
where S w = w y E ( G ) ξ ( y ) and S y = w y E ( G ) ξ ( w ) .
For more details about topological indices, see [25,26,27,28,29].

2. Face-Centered Cubic Lattice

Face-centered cubic lattice F C C ( n ) comprises unit cells that are 3D squares with an atom at each edge of the solid shape and a particle in the focal point of each face of the 3D shape, see Figure 1. In our diagrams, vertices (focuses) speak to the atoms; the terms 3D square vertices (block focuses) and confront focuses (or face centre points) will be utilized, individually. An unordered pair of nodes (atoms) that specify a line joining these two nodes (atoms) is said to form an edge. In fact, the F C C ( n ) structure has the biggest pressing thickness in 3D space: This is a standout amongst the highest productive models to cover similar size circles in a volume [30,31], as can be found in Figure 1. Along these lines, this structure is otherwise called a cubic nearest pressed precious stone structure. Metals with an F C C ( n ) structure include copper, aluminum, nickel silver, and gold. In this paper, we utilized graphs that speak to lines of unit cells of the F C C ( n ) cross section (i.e., the measurement of our space is ( n × 1 × 1 ) unit cells), see Figure 2.

Methodology of Face-Centered Cubic Lattice F C C ( n ) Formulas

The molecular graph of face-centered cubic lattice F C C ( n ) adds up to 9 n + 5 vertices, among which the quantity of vertices of degree 4 is 5 n + 1 , the quantity of vertices of degree 6 is 8, and the quantity of vertices of degree 9 is 4 n 4 . Likewise, then, adding up the number of edges again gives us 28 n + 8 . To find the abstracted indices, we partition the edges of F C C ( n ) The first edge segment contains 24 edges w y , where ξ ( w ) = 4 and ξ ( y ) = 6 . The second edge segment contains 20 n 20 edges w y , where ξ ( w ) = 4 and ξ ( y ) = 9 . The third edge segment contains 8 edges w y , where ξ ( w ) = 6 and ξ ( y ) = 6 . The fourth edge segment contains 8 edges w y , where ξ ( w ) = 6 and ξ ( y ) = 9 . The fifth edge segment contains 8 n 12 edges w y , where ξ ( w ) = ξ ( y ) = 9 . Table 1 shows the edge partition of F C C ( n ) with n 2 .

3. Main Results

In the next theorems, we computed the topological indices—to be specific, the Zagreb-type indices, the forgotten index, Balaban index, augmented Zagreb index, the fourth version of atom–bond connectivity index, and the fifth version of the geometric arithmetic index for face-centered cubic lattice F C C ( n ) . Moreover, to compute our results, we used the method of combinatorial computing, analytical techniques, the vertex partition method, edge partition method, graph theoretical tools, the degree counting method, and the sum of degrees of neighbours method. Moreover, we used MATLAB for mathematical calculations and verifications. We also used the maple to plot these mathematical results.
Theorem 1.
Consider face-centered cubic lattice F C C ( n ) , then its multiple Zagreb indices are:
P M 1 ( F C C ( n ) ) = 10 24 × 13 ( 20 n 20 ) ) × 16 8 × 15 8 × 18 ( 8 n 12 ) , P M 2 ( F C C ( n ) ) = 24 24 × 36 ( 20 n 20 ) ) × 36 8 × 54 8 × 81 ( 8 n 12 ) .
Proof. 
Let G be the graph of face-centered cubic lattice F C C ( n ) . Now, using Table 1 and Equation (1), add Equation (2) to the following computation:
P M 1 ( G ) = w y E ( G ) [ ξ ( w ) + ξ ( y ) ] P M 1 ( F C C ( n ) ) = w y E 1 ( G ) ξ ( w ) + ξ ( y ) × w y E 2 ( G ) ξ ( w ) + ξ ( y ) × w y E 3 ( G ) ξ ( w ) + ξ ( y ) × w y E 4 ( G ) ) ξ ( w ) + ξ ( y ) × w y E 5 ( G ) ) ξ ( w ) + ξ ( y ) = 10 24 × 13 ( 20 n 20 ) ) × 16 8 × 15 8 × 18 ( 8 n 12 ) P M 2 ( G ) = w y E ( G ) [ ξ ( w ) × ξ ( y ) ] P M 2 ( F C C ( n ) ) = w y E 1 ( G ) ξ ( w ) × ξ ( y ) × w y E 2 ( G ) ξ ( w ) × ξ ( y ) × w y E 3 ( G ) ξ ( w ) × ξ ( y ) × w y E 4 ( G ) ) ξ ( w ) × ξ ( y ) × w y E 5 ( G ) ) ξ ( w ) × ξ ( y ) = 24 24 × 36 ( 20 n 20 ) ) × 36 8 × 54 8 × 81 ( 8 n 12 )
 □
Theorem 2.
Consider face-centered cubic lattice F C C ( n ) , then its forgotten topological index is equal to:
F ( G ) = 3236 n 1124 .
Proof. 
Let G be a the graph of face-centered cubic lattice F C C ( n ) . Now, using Table 1 and Equation (3), the F ( G ) index can be calculated as:
F ( G ) = w y E ( G ) ξ ( w ) 2 + ξ ( y ) 2 F ( G ) = w y E 1 ( G ) ξ ( w ) 2 + ξ ( y ) 2 + w y E 2 ( G ) ξ ( w ) 2 + ξ ( y ) 2 + w y E 3 ( G ) ξ ( w ) 2 + ξ ( y ) 2 + w y E 4 ( G ) ξ ( w ) 2 + ξ ( y ) 2 + w y E 5 ( G ) ξ ( w ) 2 + ξ ( y ) 2 = ( 24 ) 4 2 + 6 2 + ( 20 n 20 ) 4 2 + 9 2 + ( 8 ) 6 2 + 6 2 + ( 8 ) 6 2 + 9 2 + ( 8 n 12 ) 9 2 + 9 2 = ( 52 ) ( 24 ) + ( 97 ) ( 20 n 20 ) + ( 72 ) ( 8 ) + ( 117 ) ( 8 ) + ( 162 ) ( 8 n 12 ) = 3236 n 1124 .
 □
Theorem 3.
Consider face-centered cubic lattice F C C ( n ) , then its augmented Zagreb index is:
A Z I ( G ) = = 1185105411 n 681472 248308379068617 374298496000 .
Proof. 
Let G be a the graph of face-centered cubic lattice F C C ( n ) . Now, using Table 1 and Equation (4), A Z I ( G ) can be calculated as:
A Z I ( G ) = w y E ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3 A Z I ( G ) = w y E 1 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3 + w y E 2 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3 + w y E 3 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3 + w y E 4 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3 + w y E 5 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) 2 3
A Z I ( G ) = ( 24 ) 4 × 6 4 + 6 2 3 + ( 20 n 20 ) 4 × 9 4 + 9 2 3 + ( 8 ) 6 × 6 6 + 6 2 3 + ( 8 ) 6 × 9 6 + 9 2 3 + ( 8 n 12 ) 9 × 9 9 + 9 2 3 = 1185105411 n 681472 248308379068617 374298496000 .
 □
Theorem 4.
Consider face-centered cubic lattice F C C ( n ) , then its Balaban index J ( G ) index is:
J ( G ) = 1064 n 2 + ( 616 n + 176 ) 6 536 n 240 171 n + 27 .
Proof. 
Let G be the graph of face-centered cubic lattice F C C ( n ) . The above result can be proven using Table 1 and Equation (5) in the following computation:
J ( G ) = m m n + 2 w y E ( G ) 1 ξ ( w ) ξ ( y ) J ( G ) = m m n + 2 w y E 1 ( G ) 1 ξ ( w ) ξ ( y ) + w y E 2 ( G ) 1 ξ ( w ) ξ ( y ) + w y E 3 ( G ) 1 ξ ( w ) ξ ( y ) + m m n + 2 w y E 4 ( G ) 1 ξ ( w ) ξ ( y ) + w y E 5 ( G ) 1 ξ ( w ) ξ ( y ) = 28 n + 8 19 n + 3 24 4 × 6 + 20 n 20 4 × 9 + 8 6 × 6 + 8 6 × 9 + 8 n 12 9 × 9 = 1064 n 2 + ( 616 n + 176 ) 6 536 n 240 171 n + 27 .
 □
Theorem 5.
Consider the graph of face-centered cubic lattice F C C ( n ) , then its redefined Zegreb indices are:
R e Z G 1 ( G ) = 9 n + 5 , R e Z G 2 ( G ) = 5940 n + 33 13 , R e Z G 3 ( G ) = 21024 n 11160 .
Proof. 
Let G be the graph of F C C ( n ) . Then, using Equation (6) and Table 1, the first, second, and third redefine Zagreb indices are computed as below:
R e Z G 1 ( G ) = w y E ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) = w y E 1 ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) + w y E 2 ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) + w y E 3 ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) + w y E 4 ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) + w y E 5 ( G ) ξ ( w ) + ξ ( y ) ξ ( w ) ξ ( y ) = ( 24 ) 4 + 6 4 × 6 + ( 20 n 20 ) 4 + 9 4 × 9 + ( 8 ) 6 + 6 6 × 6 + ( 8 ) 6 + 9 6 × 9 + ( 8 n 12 ) 9 + 9 9 × 9 = 9 n + 5 .
 □
Using Equation (7) and Table 1, the second redefined Zagreb index is computed as below:
R e Z G 2 ( G ) = w y E ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) = w y E 1 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) + w y E 2 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) + w y E 3 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) + w y E 4 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y ) + w y E 5 ( G ) ξ ( w ) ξ ( y ) ξ ( w ) + ξ ( y )
R e Z G 2 ( G ) = ( 24 ) 4 × 6 4 + 6 + ( 20 n 20 ) 4 × 9 4 + 9 + ( 8 ) 6 × 6 6 + 6 + ( 8 ) 6 × 9 6 + 9 + ( 8 n 12 ) 9 × 9 9 + 9 = 5940 n + 33 13 .
Now, using Equation (8) and Table 1, the third redefined Zagreb index is computed as below:
R e Z G 3 ( G ) = w y E ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) = w y E 1 ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) + w y E 2 ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) + w y E 3 ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) + w y E 4 ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) + w y E 5 ( G ) ( ξ ( w ) ξ ( y ) ) ( ξ ( w ) + ξ ( y ) ) = ( 24 ) ( 4 × 6 ) ( 4 + 6 ) + ( 20 n 20 ) ( 4 × 9 ) ( 4 + 9 ) + ( 8 ) ( 6 × 6 ) ( 6 + 6 ) + ( 8 ) ( 6 × 9 ) ( 6 + 9 ) + ( 8 n 12 ) ( 9 × 9 ) ( 9 + 9 ) = 21024 n 11160 .
Theorem 6.
Consider face-centered cubic lattice F C C ( n ) , then its first and second Zagreb polynomials are equal to:
M 1 ( G , x ) = 24 x 10 + ( 20 n 20 ) x 13 + 8 x 12 + 8 x 15 + ( 12 n 8 ) x 18 , M 2 ( G , x ) = 24 x 24 + ( 20 n 20 ) x 36 + 8 x 36 + 8 x 54 + ( 12 n 8 ) x 81 .
Proof. 
Let G be the graph of F C C ( n ) . Now, using Table 1 and Equations (9) and (10), the Zagreb polynomials are computed as below:
M 1 ( G , x ) = w y E ( G ) x ( ξ ( w ) + ξ ( y ) ) M 1 ( G , x ) = w y E 1 ( G ) x ( ξ ( w ) + ξ ( y ) ) + w y E 2 ( G ) x ( ξ ( w ) + ξ ( y ) ) + w y E 3 ( G ) x ( ξ ( w ) + ξ ( y ) ) + w y E 4 ( G ) x ( ξ ( w ) + ξ ( y ) ) + w y E 5 ( G ) x ( ξ ( w ) + ξ ( y ) ) = ( 24 ) x ( 4 + 6 ) + ( 20 n 20 ) x ( 4 + 9 ) + ( 8 ) x ( 6 + 6 ) + ( 8 ) x ( 6 + 9 ) + ( 12 n 8 ) x ( 9 + 9 ) = 24 x 10 + ( 20 n 20 ) x 13 + 8 x 12 + 8 x 15 + ( 12 n 8 ) x 18
M 2 ( G , x ) = w y E ( G ) x ( ξ ( w ) × ξ ( y ) ) M 2 ( G , x ) = w y E 1 ( G ) x ( ξ ( w ) × ξ ( y ) ) + w y E 2 ( G ) x ( ξ ( w ) × ξ ( y ) ) + w y E 3 ( G ) x ( ξ ( w ) × ξ ( y ) ) + w y E 4 ( G ) x ( ξ ( w ) × ξ ( y ) ) + w y E 5 ( G ) x ( ξ ( w ) × ξ ( y ) ) = ( 24 ) x ( 4 × 6 ) + ( 20 n 20 ) x ( 4 × 9 ) + ( 8 ) x ( 6 × 6 ) + ( 8 ) x ( 6 × 9 ) + ( 12 n 8 ) x ( 9 × 9 ) = 24 x 24 + ( 20 n 20 ) x 36 + 8 x 36 + 8 x 54 + ( 12 n 8 ) x 81 .
 □
Theorem 7.
Consider face-centered cubic lattice F C C ( n ) , then its first and second hyper-Zagreb polynomials are equal to:
H M 1 ( G , x ) = 24 x 100 + ( 20 n 20 ) x 169 + 8 x 1296 + 8 x 225 + ( 12 n 8 ) x 324 , H M 2 ( G , x ) = 24 x 576 + ( 20 n 20 ) x 1296 + 8 x 1296 + 8 x 2916 + ( 12 n 8 ) x 6561 .
Proof. 
Let G be the graph of F C C ( n ) . Now, using Table 1 and Equations (11) and (12), the hyper-Zagreb polynomials are computed as:
H M 1 ( G , x ) = w y E ( G ) x ( ξ ( w ) + ξ ( y ) ) 2 H M 1 ( G , x ) = w y E 1 ( G ) x ( ξ ( w ) + ξ ( y ) ) 2 + w y E 2 ( G ) x ( ξ ( w ) + ξ ( y ) ) 2 + w y E 3 ( G ) x ( ξ ( w ) + ξ ( y ) ) 2 + w y E 4 ( G ) x ( ξ ( w ) + ξ ( y ) ) 2 + w y E 5 ( G ) x ( ξ ( w ) + ξ ( y ) ) 2 = ( 24 ) x ( 4 + 6 ) 2 + ( 20 n 20 ) x ( 4 + 9 ) 2 + ( 8 ) x ( 6 + 6 ) 2 + ( 8 ) x ( 6 + 9 ) 2 + ( 12 n 8 ) x ( 9 + 9 ) 2 = 24 x 100 + ( 20 n 20 ) x 169 + 8 x 144 + 8 x 225 + ( 12 n 8 ) x 324
H M 2 ( G , x ) = w y E ( G ) x ( ξ ( w ) × ξ ( y ) ) 2 H M 2 ( G , x ) = w y E 1 ( G ) x ( ξ ( w ) × ξ ( y ) ) 2 + w y E 2 ( G ) x ( ξ ( w ) × ξ ( y ) ) 2 + w y E 3 ( G ) x ( ξ ( w ) × ξ ( y ) ) 2 + w y E 4 ( G ) x ( ξ ( w ) × ξ ( y ) ) 2 + w y E 5 ( G ) x ( ξ ( w ) × ξ ( y ) ) 2 = ( 24 ) x ( 4 × 6 ) 2 + ( 20 n 20 ) x ( 4 × 9 ) 2 + ( 8 ) x ( 6 × 6 ) 2 + ( 8 ) x ( 6 × 9 ) 2 + ( 12 n 8 ) x ( 9 × 9 ) 2 = 24 x 576 + ( 20 n 20 ) x 1296 + 8 x 1296 + 8 x 2916 + ( 12 n 8 ) x 6561 .
 □
Table 2 shows the partition of the edges of the graph face-centered cubic lattice F C C ( n ) depending on the sum of degrees of the neighboring vertices of the end vertices of each edge. The next theorem shows the exact value of the fourth version of atom–bond connectivity index A B C 4 of F C C ( n ) .
Theorem 8.
Consider the graph G F C C ( n ) , then the fourth version of index A B C 4 for F C C ( n ) is:
A B C 4 ( G ) = 5.72406962 n + 3.6455090 .
Proof. 
Let G be the graph structure of F C C ( n ) . Then, using Table 2 and Equation (13), the fourth version of index A B C 4 is computed as follows:
S ( G ) = w y E ( G ) S w + S y 2 S w × S y A B C 4 ( G ) = w y E 1 ( G ) S w + S y 2 S w × S y + w y E 2 ( G ) S w + S y 2 S w × S y + w y E 3 ( G ) S w + S y 2 S w × S y + w y E 4 ( G ) S w + S y 2 S w × S y + w y E 5 ( G ) S w + S y 2 S w × S y + w y E 6 ( G ) S w + S y 2 S w × S y + w y E 7 ( G ) S w + S y 2 S w × S y + w y E 8 ( G ) S w + S y 2 S w × S y + w y E 9 ( G ) S w + S y 2 S w × S y + w y E 10 ( G ) S w + S y 2 S w × S y
A B C 4 ( G ) = ( 8 ) 33 + 33 2 33 × 33 + ( 8 ) 24 + 33 2 24 × 33 + ( 16 ) 30 + 33 2 30 × 33 + ( 24 ) 36 + 53 2 36 × 53 + ( 16 ) 30 + 53 2 30 × 53 + ( 8 ) 33 + 53 2 33 × 53 + ( 8 ) 53 + 53 2 53 × 53 + ( 8 ) 53 + 56 2 53 × 56 + ( 8 n 28 ) 56 + 56 2 56 × 56 + ( 20 n 60 ) 36 + 56 2 36 × 56 = 5.72406962 n + 3.6455090 .
 □
Theorem 9.
Consider the graph G F C C ( n ) , then the fifth version of geometric arithmetic index G A 5 of F C C ( n ) is:
G A 5 ( G ) = 9.53740238 n + 7.3250487 .
Proof. 
Let G be the graph structure of F C C ( n ) . Then, using Table 2 and Equation (14), the fifth version of geometric arithmetic index G A 5 is computed as follows:
G A 5 ( G ) = w y E ( G ) 2 S w S y S w + S y = w y E 1 ( G ) 2 S w S y S w + S y + w y E 2 ( G ) 2 S w S y S w + S y + w y E 3 ( G ) 2 S w S y S w + S y + w y E 4 ( G ) 2 S w S y S w + S y + w y E 5 ( G ) 2 S w S y S w + S y + w y E 6 ( G ) 2 S w S y S w + S y + w y E 7 ( G ) 2 S w S y S w + S y + w y E 8 ( G ) 2 S w S y S w + S y + w y E 9 ( G ) 2 S w S y S w + S y + w y E 10 ( G ) 2 S w S y S w + S y
G A 5 ( G ) = ( 8 ) 2 33 × 33 33 + 33 + ( 8 ) 2 24 × 33 24 + 33 + ( 16 ) 2 30 × 33 30 + 33 + ( 24 ) 2 36 × 53 36 + 53 + ( 16 ) 2 30 × 53 30 + 53 + ( 8 ) 2 33 × 53 33 + 53 + ( 8 ) 2 53 × 53 53 + 53 + ( 8 ) 2 53 × 56 53 + 56 + ( 8 n 28 ) 2 56 × 56 56 + 56 + ( 20 n 60 ) 2 36 × 56 36 + 56 = 9.53740238 n + 7.3250487 .
 □

4. Comparisons and Discussion

In this section, we computed all the indices for different values of n for face-centered cubic lattice F C C ( n ) . In addition, we constructed Table 3 and Table 4 for small values of n for these topological indices to the structure of face-centered cubic lattice F C C ( n ) . Now, from Table 3 and Table 4, we can easily see that all indices are in increasing order as the value of n are increases.
The graphical representation of the P M 1 ( G ) and P M 2 ( G ) indices is depicted in Figure 3, that of the forgotten topological index in Figure 4, that of the augmented Zagreb index in Figure 5, that of the Balaban index in Figure 6, that of the first, second, and third Zagreb indices in Figure 7, that of Zagreb polynomials M 1 ( G , x ) and M 2 ( G , x ) in Figure 8, that of hyper-Zagreb polynomials in Figure 9, and that of the A B C 4 index and G A 5 index in Figure 10.

5. Conclusions

In this paper, we studied a reputable lattice, namely face-centered cubic lattice F C C ( n ) , and we determined the topological indices, namely the Zagreb-type indices, the forgotten index, Balaban index, the fourth version of A B 4 , and the fifth version of the geometric arithmetic index for face-centered cubic lattice F C C ( n ) .
Since the first and second multiple Zagreb indices, redefined Zagreb indices were found to occur for computation of the total π -electron energy of the molecules; in the case of face-centered cubic lattice F C C ( n ) , their values provide total π -electron energy in increasing order for higher values of n. Moreover, the forgotten topological index, Balaban index, and augmented Zagreb index announced that the physicochemical flexibility of face-centered cubic lattice F C C ( n ) is fruitful for chemical reactions. Further, the fourth atom–bond connectivity A B C 4 and the fifth version of the geometric arithmetic index G A 5 index provide a very good correlation for computing the strain energy of molecules; one can easily see that the strain energy of face-centered cubic lattice F C C ( n ) is higher as the values of n increases. Additionally, these result are helpful from a chemical point of view as well as in pharmaceutical science. However, computing the distance-based and counting-related topological indices for these symmetrical chemical structures still remains open for investigation and a challenge for researchers.

Author Contributions

H.Y. contributed in conceptualization, designing the experiments, funding, supervision, and analyzing the data. M.K.S. and S.S.K. contributed in methodology, software, validation, and formal analyzing. M.A.R. and S.A. contributed in performing the experiments, resources, some computations, and writing the initial draft of the paper. M.K.S. and S.A. investigated and wrote the final draft. All authors read and approved the final version of the paper.

Funding

This work was supported by the Soft Scientific Research of Sichuan Province under grant 2018ZR0265, Sichuan Military and Civilian Integration Strategy Research Center under grant JMRH-1818, and Sichuan Provincial Department of Education (Key Project) under grant 18ZA0118.

Acknowledgments

The authors are grateful to the anonymous referees for their valuable comments and suggestions that improved this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Catlow, C.R.A. Modelling and predicting crystal structures. Interdiscip. Sci. Rev. 2015, 40, 294–307. [Google Scholar] [CrossRef]
  2. 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]
  3. Bača, M.; Horváthová, J.; Mokrišová, M.; Semanicová-Fenovcíková, A.; Suhányiová, A. On topological indices of carbon nanotube network. Can. J. Chem. 2015, 93, 1–4. [Google Scholar] [CrossRef]
  4. Gao, W.; Siddiqui, M.K. Molecular Descriptors of Nanotube, Oxide, Silicate, and Triangulene Networks. J. Chem. 2017, 2017, 6540754. [Google Scholar] [CrossRef]
  5. Imran, M.; Siddiqui, M.K.; Naeem, M.; Iqbal, M.A. On Topological Properties of Symmetric Chemical Structures. Symmetry 2018, 10, 173. [Google Scholar] [CrossRef]
  6. 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]
  7. Gao, W.; Siddiqui, M.K.; Naeem, M.; Rehman, N.A. Topological Characterization of Carbon Graphite and Crystal Cubic Carbon Structures. Molecules 2017, 22, 1496. [Google Scholar] [CrossRef]
  8. Gharibi, W.; Ahmad, A.; Siddiqui, M.K. On Zagreb Indices, Zagreb Polynomials of Nanocone and Nanotubes. J. Comput. Theor. Nanosci. 2016, 13, 5086–5092. [Google Scholar] [CrossRef]
  9. Idrees, N.; Naeem, M.N.; Hussain, F.; Sadiq, A.; Siddiqui, M.K. Molecular descriptors of benzenoid system. Quimica Nova 2017, 40, 143–145. [Google Scholar] [CrossRef]
  10. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef]
  11. Dobrynin, A.A.; Entringer, R.; Gutman, I. Wiener index of trees: Theory and applications. Acta Appl. Math. 2001, 66, 211–249. [Google Scholar] [CrossRef]
  12. Ghorbani, M.; Azimi, N. Note on multiple zagreb indices. Iran. J. Math. Chem. 2012, 3, 137–143. [Google Scholar]
  13. Gutman, I.; Das, C.N. The first Zagreb index 30 years after. MATCH Commun. Math. Comput. Chem. 2004, 50, 83–92. [Google Scholar]
  14. Gutman, I.; Trinajst, N. Graph theory and molecular orbitals, Total π-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
  15. Furtula, B.; Gutman, I. A forgotten topological index. J. Math. Chem. 2015, 53, 1184–1190. [Google Scholar] [CrossRef]
  16. Gao, W.; Siddiqui, M.K.; Imran, M.; Jamil, M.K.; Farahani, M.R. Forgotten Topological Index of Chemical Structure in Drugs. Saudi Pharm. J. 2016, 24, 258–267. [Google Scholar] [CrossRef]
  17. Furtula, B.; Graovac, A.; Vukicevic, D. Augmented zagreb index. J. Math. Chem. 2010, 48, 370–380. [Google Scholar] [CrossRef]
  18. Balaban, A.T. Highly discriminating distance-based topological index. Chem. Phys. Lett. 1982, 89, 399–404. [Google Scholar] [CrossRef]
  19. Balaban, A.T.; Quintas, L.V. The smallest graphs, trees, and 4-trees with degenerate topological index. J. Math. Chem. 1983, 14, 213–233. [Google Scholar]
  20. Ranjini, P.S.; Lokesha, V.; Usha, A. Relation between phenylene and hexagonal squeez using harmonic index. Int. J. Graph. Theory 2013, 1, 116–121. [Google Scholar]
  21. Fath-Tabar, G.H. Zagreb Polynomial and Pi Indices of some Nano Structures. Dig. J. Nanomater. Biostruct. 2009, 4, 189–191. [Google Scholar]
  22. Chaluvaraju, B.; Boregowda, H.S.; Diwakar, S.A. Hyper-Zagreb indices and their polynomials of some special kinds of windmill graphs. Int. J. Adv. Math. 2017, 4, 21–32. [Google Scholar]
  23. Ghorbani, A.; Hosseinzadeh, M.A. Computing ABC4 index of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2010, 4, 1419–1422. [Google Scholar]
  24. Graovac, A.; Ghorbani, M.; Hosseinzadeh, M.A. Computing fifth geometric–arithmetic index for nanostar dendrimers. J. Math. Nanosci. 2011, 1, 33–42. [Google Scholar]
  25. Siddiqui, M.K.; Imran, M.; Ahmad, A. On zagreb indices, zagreb polynomials of some nanostar dendrimers. Appl. Math. Comput. 2016, 280, 132–139. [Google Scholar] [CrossRef]
  26. Siddiqui, M.K.; Gharibi, W. On Zagreb Indices, Zagreb Polynomials of Mesh Derived Networks. J. Comput. Theor. Nanosci. 2016, 13, 8683–8688. [Google Scholar] [CrossRef]
  27. Siddiqui, M.K.; Naeem, M.; Rahman, N.A.; Imran, M. Computing topological indices of certain networks. J. Optoelectron. Adv. Mater. 2016, 18, 884–892. [Google Scholar]
  28. Kang, S.M.; Siddiqui, M.K.; Rehman, N.A.; Naeem, M.; Muhammad, M.H. Topological properties of 2-dimensional silicon-carbons. IEEE Access 2018, 6, 59362–59373. [Google Scholar] [CrossRef]
  29. Gao, W.; Siddiqui, M.K.; Naeem, M.; Imran, M. Computing multiple ABC index and multiple GA index of some grid graphs. Open Phys. 2018, 16, 588–598. [Google Scholar] [CrossRef]
  30. Conway, J.H.; Sloane, N.J.A. Sphere Packings, Lattices, and Groups, 2nd ed.; Springer: New York, NY, USA, 1993. [Google Scholar]
  31. Mujahed, H.; Nagy, B. Exact Formula for Computing the Hyper-Wiener Index on Rows of Unit Cells of the Face-Centred Cubic Lattice. An. Univ. Ovidius Constanta 2018, 26, 169–187. [Google Scholar] [CrossRef]
Figure 1. (a) Unit cell of F C C ( n ) ; (b) Face-centered cubic lattice F C C ( 2 ) .
Figure 1. (a) Unit cell of F C C ( n ) ; (b) Face-centered cubic lattice F C C ( 2 ) .
Processes 07 00280 g001
Figure 2. Face-centered cubic lattice F C C ( n ) .
Figure 2. Face-centered cubic lattice F C C ( n ) .
Processes 07 00280 g002
Figure 3. The graphical representation of the P M 1 ( G ) and P M 2 ( G ) indices.
Figure 3. The graphical representation of the P M 1 ( G ) and P M 2 ( G ) indices.
Processes 07 00280 g003
Figure 4. The graphical representation of the forgotten topological index.
Figure 4. The graphical representation of the forgotten topological index.
Processes 07 00280 g004
Figure 5. The graphical representation of the augmented Zagreb index.
Figure 5. The graphical representation of the augmented Zagreb index.
Processes 07 00280 g005
Figure 6. The graphical representation of Balaban index.
Figure 6. The graphical representation of Balaban index.
Processes 07 00280 g006
Figure 7. The graphical representation of the first, second, and third Zagreb indices of F C C ( n ) . The red, blue, and green colors represent R e Z G 1 ( G ) , R e Z G 2 ( G ) , and R e Z G 3 ( G ) , respectively.
Figure 7. The graphical representation of the first, second, and third Zagreb indices of F C C ( n ) . The red, blue, and green colors represent R e Z G 1 ( G ) , R e Z G 2 ( G ) , and R e Z G 3 ( G ) , respectively.
Processes 07 00280 g007
Figure 8. The graphical representation of M 1 ( G , x ) and M 2 ( G , x ) polynomials of face-centered cubic lattice F C C ( n ) . The colors blue and green represent M 1 ( G , x ) and M 2 ( G , x ) , respectively.
Figure 8. The graphical representation of M 1 ( G , x ) and M 2 ( G , x ) polynomials of face-centered cubic lattice F C C ( n ) . The colors blue and green represent M 1 ( G , x ) and M 2 ( G , x ) , respectively.
Processes 07 00280 g008
Figure 9. The graphical representation of the first and second hyper-Zagreb polynomial in a 2 D structure of face-centered cubic lattice F C C ( n ) . The colors blue and green represent H M 1 ( G , x ) and H M 2 ( G , x ) , respectively.
Figure 9. The graphical representation of the first and second hyper-Zagreb polynomial in a 2 D structure of face-centered cubic lattice F C C ( n ) . The colors blue and green represent H M 1 ( G , x ) and H M 2 ( G , x ) , respectively.
Processes 07 00280 g009
Figure 10. The graphical representation of A B C 4 index and G A 5 index of face-centered cubic lattice F C C ( n ) . The colors brown and green represent A B C 4 and G A 5 , respectively.
Figure 10. The graphical representation of A B C 4 index and G A 5 index of face-centered cubic lattice F C C ( n ) . The colors brown and green represent A B C 4 and G A 5 , respectively.
Processes 07 00280 g010
Table 1. Degree-based partition of edges of face-centered cubic lattice F C C ( n ) .
Table 1. Degree-based partition of edges of face-centered cubic lattice F C C ( n ) .
( ξ ( w ) , ξ ( y ) ) FrequencyEdge Sets
( 4 , 6 ) 24 E 1
( 4 , 9 ) 20 n 20 E 2
( 6 , 6 ) 8 E 3
( 6 , 9 ) 8 E 4
( 9 , 9 ) 8 n 12 E 5
Table 2. Degree-based partition of edges of F C C ( n ) , for n 2 .
Table 2. Degree-based partition of edges of F C C ( n ) , for n 2 .
( S u , S v ) Number of EdgesEdge Sets
(33, 33)8 E 1 ( G )
(24, 33)8 E 2 ( G )
(30, 33)16 E 3 ( G )
(36, 53)24 E 4 ( G )
(30, 53)16 E 5 ( G )
(33, 53)8 E 6 ( G )
(53, 53)8 E 7 ( G )
(53, 56)8 E 8 ( G )
(56, 56)8n-28 E 9 ( G )
(36, 56)20n-60 E 10 ( G )
Table 3. Comparison of all indices for face-centered cubic lattice F C C ( n ) .
Table 3. Comparison of all indices for face-centered cubic lattice F C C ( n ) .
n PM 1 ( FCC ( n ) ) PM 2 ( FCC ( n ) ) F ( FCC ( n ) ) AZI ( FCC ( n ) ) J ( FCC ( n ) )
1 1.4 × 10 38 2.5 × 10 18 2112 49.31 8.9
2 3.7 × 10 66 3.4 × 10 38 5348 60.34 29.8
3 6.5 × 10 89 5.6 × 10 57 8548 80.41 61.4
4 7.6 × 10 95 7.4 × 10 76 11820 97.18 97.6
5 9.4 × 10 110 6.2 × 10 95 15056 115.08 105.7
6 5.8 × 10 125 8.5 × 10 119 18292 135.21 125.5
Table 4. Comparison of all indices for face-centered cubic lattice F C C ( n ) .
Table 4. Comparison of all indices for face-centered cubic lattice F C C ( n ) .
n ReZ 1 ( FCC ( n ) ) ReZ 2 ( FCC ( n ) ) ReZ 3 ( FCC ( n ) ) ABC 4 ( FCC ( n ) ) GA 5 ( FCC ( n ) )
114 459.6 9864 59.31 47.42
223 916.38 30888 62.34 65.18
332 1373.5 51912 81.41 81.23
441 1830.5 72936 95.11 97.04
550 2287.6 93960 107.12 117.31
659 2744.5 114984 1157.31 137.24

Share and Cite

MDPI and ACS Style

Yang, H.; Rashid, M.A.; Ahmad, S.; Khan, S.S.; Siddiqui, M.K. On Molecular Descriptors of Face-Centered Cubic Lattice. Processes 2019, 7, 280. https://doi.org/10.3390/pr7050280

AMA Style

Yang H, Rashid MA, Ahmad S, Khan SS, Siddiqui MK. On Molecular Descriptors of Face-Centered Cubic Lattice. Processes. 2019; 7(5):280. https://doi.org/10.3390/pr7050280

Chicago/Turabian Style

Yang, Hong, Muhammad Aamer Rashid, Sarfraz Ahmad, Saima Sami Khan, and Muhammad Kamran Siddiqui. 2019. "On Molecular Descriptors of Face-Centered Cubic Lattice" Processes 7, no. 5: 280. https://doi.org/10.3390/pr7050280

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