Molecular Properties of Carbon Crystal Cubic Structures

Abstract Graph theory assumes an imperative part in displaying and planning any synthetic structure or substance organizer. Chemical graph theory facilitates in conception of the chemical graphs for their atomic properties. The graphical structure of a chemical involves atoms termed as vertices and the line segment between two different vertices are called edges. In this manuscript, our concentration is on the chemical graph of carbon graphite and cubic carbon. Additionally, we also define a procedure and calculate the degree based topological indices namely Zagreb type indices, Balaban, Forgotten and Augmented indices.


Introduction
Graph theory is capable of forming and creating various chemical structures and networks. Chemical graph theory uses the theory of graphs in modelling chemical phenomena; this theory is very useful for the analysis of chemical structures. The examinations of structures of molecules and data are made possible by using chemical descriptors. A large number of topological descriptors are examined and utilized in theoretical chemistry [1,2,3].
A topological descriptor is a numerical value which demonstrates some valuable data related to chemical structures. It is a numerical invariant of chemical graphs and is valuable to connect with the bioactivities and physicochemical properties of the structure. Scientists observed that these indices were an effective and valuable instrument in the portrayal of chemical graph. A few applications identified with topological descriptors of chemical graphs can be found in [4,5,6].
The analysts have used chemical graphs to describe the topological uses of carbons in a nano cones, in chains of extremal pentagons, tree like poly phenylene, spiro hexagonal frame-works, poly-phenylene dendrimers nano stars, and palomino's chain [7,8,9].
A large number of allotropes of carbon have been discovered such as nanotubes, buckminsterfullerenes and nanosheets. The uses of several allotropes of carbons are studied in [10,11,12].
The notion of topological index originated with the work of Wiener [13], whilst he discussed boiling points of paraffins. Soon after, this numeric quantity was retitled as Wiener index. The Wiener index was the earliest and highly studied topological index, both from putative perspectives and application, and is characterized as the cumulative of disjunctions among all the sets of vertices of G; for more subtle elements see [14,15,16].
A graph G=(V, E) where V is the set of vertices and E denotes the set of edges of G, the degree of a vertex u is the total number of edges associated with u and is denoted by λ(u).
Furtula, along with Gutman [17] presented forgotten topological descriptor as u and v are two vertices of an edge E: , where u, v are vertices. Inspired from the successful discovery of ABC index, Furtula et al. [18], presented the augmented Zagreb index as: Balaban defined a new index for a graph G with order n and size m, called Balaban index as [19]: where m, n are total number of vertices and total number of edges respectively. The re-defined Zagreb indices are introduced by Ranjini et al. [20] in the following way; (4)

Applications of Topological Descriptors
Furtula and Gutman [21] raise the insightful limit of forgotten topological index is moderately analogous to first Zagreb index. They designed it for the acentric factors, entropy and to gain relationships coefficient greater than 0.95. These facts highlight the significance of the forgotten index examining the manufactured and pharmacological characteristics of the atomic structure of medication. Gao et al. [22] demonstrated the forgotten topological index of approximately gigantic drug nuclear compositions. The redefined Zagreb indices give a reasonable association with the steadfastness of unconventional alkane; the all-inclusive alkane and for enlisting the strain imperativeness of different cycloalkanes [3]. To relate with specific physico-chemical properties, Balaban topological descriptor has lot of favoured judicious command over the perceptive vitality of Randic index [23].
Sun et.al. discovered approximately fundamental properties of forgotten descriptor and uncovered that rundown can invigorate the physico-engineered versatility of Zagreb type indices.
The re-defined Zagreb type indices are used for figuring of the total π-electron energy of the molecules inside specific deduced verbalizations [24]. For further results, see [25].

Methods
To compute our results, we utilize the strategy for combinatorial techniques, vertex and edge based partitions. Matlab was used for scientific computations and verifications. We used maple for plotting these mathematical results.

Structure of Carbon Graphite CG(m,n)
Graphite is an amalgamation of carbon. The chemical graph of carbon graphite CG(m,n) is comprised of a hexagon silhouettes. Carbon graphite is comprised of hexagons as layers in a steady progression and amid these strata there is a frail [3]. The chemical graph of carbon graphite CG(m,n) for it-levels is delineated in Figure 1

Methodology of Carbon: Graphite CG(m,n) Formulas
There are 2t(mn + m + n) vertices and 2n(2mt+t)+m(3tn)-t-m edges in CG(m,n). A solitary stratum in carbon graphite delineates the graphene layer. Carbon graphite is comprised of various stratum of graphene. The t is the stratum that delineates graphene stratums in carbon graphite, m is the quantity of lines and n is the quantity of: sections in each layer with m is taken as n duplicates of hexagon consecutively and n is taken as m duplicates of hexagons in segment see Figure 1 (see [25]).
In CG(m,n), there are 2(1 + nt + m) vertices of degree 2, 2t -4 + 2mt -2m + 2mn vertices of degree 3 and 2mnt-2t+2-2mn vertices of degree 4. The edge set of CG(m,n) is isolated hooked on six allotments in light of the level of termination vertices. Table 1 represents edge parcel of CG(m,n).

Structure of Crystal Cubic Carbon
The organisation of crystal cubic carbon comprises of cubes. The chemical graph of precious stone cubic carbon CCC(n) for first glassy is portrayed in Figure 3 (see [25]). For second glassy, the shape is built at each end vertex of first glassy. The second glassy of CCC(n) is portrayed in Figure 4 (see [25]). So proceeding with this methodology to get the following level (see [25]).

Methodology of crystal cubic carbon CCC(n) Formulas
The total number of vertices and edges for CCC(n) are presented in following formulas: In CCC(n), 8(2 3 -1) n-1 vertices of degree 3 and there are 2(24 (2 1) + 3((2 1) vertices of degree 4. The edge set of CCC(n) is isolated into three parcels see Table 2.
Theorem.6. If G be a graph of carbon graphite CCC(n). Then its Augmented Zagreb index is: Proof: Now using equations (2), and Table 2, we have:

Comparisons and Discussion
In this fragment, we have calculated all indices for altered tenets of m, n, t for mutual organisations CG(m, n). In accumulation, we build  Figure 7 and Figure 8 respectively, for certain values of n.        and ReG 3 (G), respectively. Its easy to see that ReG 3 (G) is more dominating in the given domain.

Conclusions
In this paper, we have studied and calculated degree based topological indices, mainly Forgotten index, Augmented Zagreb index, Balban index and redefined Zagreb indices for CG(m, n) and CCC(n).