Abstract
A topological index (TI) is a real number that defines the relationship between a chemical structure and its properties and remains invariant under graph isomorphism. TIs defined for chemical structures are capable of predicting physical properties, chemical reactivity and biological activity. Several kinds of TIs have been defined and studied for different molecular structures. Graphene is the thinnest material known to man and is also extremely strong while being a good conductor of heat and electricity. With such unique features, graphene and its derivatives have found commercial uses and have also fascinated theoretical chemists. In this article, the neighbourhood sum degree-based M-polynomial and entropy measures have been computed for graphene, graphyne and graphdiyne structures. The proper analytical expressions for these indices are derived. The obtained results will enable theoretical chemists to study these exciting structures further from a structural perspective.
1. Introduction
The study of the association between the structural formula of chemical compounds and their corresponding topological graphs was a ground-breaking advancement in investigating chemical structures. Since then, the basic concepts of chemical graph theory have been developed as a combination of principles from both mathematics and chemistry. Chemical graph theory enables mathematicians and chemists to theoretically analyse molecular compounds by depicting their structures as graphs. The vertices represent the atoms of molecules or molecule collections in a chemical graph. The edges of a chemical graph indicate the relationships between the chemical objects and generally represent reactions, reaction mechanisms, chemical bonds, or other transformations in chemical entities.
Graph theoretical tools have been gaining popularity as the primary techniques for the theoretical study of chemical compounds. QSAR/QSPR techniques, in particular, are regarded as useful computational and quasi-strategies for trying to predict the characteristics of chemical substances. These techniques are crucial in the development of new and more effective herbicides because their properties can be estimated prior to synthesising and thus influence the design. Furthermore, experimental measurements can be replaced by QSPR/QSAR models, which are less expensive and time-consuming [1]. In this context, Topological indices provide a quantitative characterisation of molecular topology.
A topological index (TI) is a real number that defines the relationship between a chemical structure and its properties and remains invariant under graph isomorphism. TIs defined for chemical structures are capable of predicting physical properties, chemical reactivity, and biological activity. Several kinds of TIs have been defined and studied for different molecular structures. Graphene is the thinnest material known to man and is also extremely strong while being a good conductor of heat and electricity. With such unique features, graphene and its derivatives have found commercial uses and have also fascinated theoretical chemists.
The first occurrence of a topological index in the literature is in the pioneering work of the eminent chemist Wiener. He described the boiling point of alkanes in terms of a path number W, which is the sum of the distances between any two atoms within the molecule. This path number later became known as the Wiener index and has been studied extensively [2]. This ground-breaking work kickstarted the research on topological indices, and its mathematical investigation began in the 1970s. Since the behaviour and properties of molecules rely heavily on the corresponding molecular structures, TIs have now been established as major molecular indices in theoretical chemistry.
A considerable number of topological indices have been proven to display a strong correlation with several properties of chemical compounds. Due to their ability to characterise a large variety of physical and chemical properties, the study of topological indices has wide-ranging applications in various fields, including computer-assisted drug discovery, deriving multi-linear regression models [3], aromatic sextet theory [4], and thermochemistry [5]. The comparative ease of using molecular TIs to determine the physicochemical properties as opposed to the complex quantum chemical calculations has also found several applications for these TIs [6]. Thus, it becomes vital to determine the various molecular indices of molecules so that suitable indices are applied to attain the desired correlations between their properties and structures. There are several kinds of TIs that are currently defined and studied in the literature. The most commonly used TIs among them are distance and degree-based indices. A topological index is said to be distance-based if its computation involves distance between vertices. A degree-based topological index is a sub-class of TIs where the index is computed based on the degrees of the end vertices of the molecular graph.
One of the most efficient and convenient ways to compute TIs is by using algebraic polynomials, where the estimations of multiple TIs are reduced to the computation of a single polynomial. For example, the Hosoya polynomial [7] is widely applied for calculating distance-based TIs. Deutsch and Klavžar [8] created a similar polynomial for computing degree-based indices. In this technique, a single polynomial, referred to as the M-polynomial, is used to compute several prominent degree-based indices. A significant number of articles in the literature deal with M-polynomial and the computation of degree-based indices using it. The degree-based entropy measures are computed for these structures [9].
The neighbourhood sum degree-based TIs are one of the recent developments in analysing chemical compounds using graph theory. They have been used for QSPR and statistics regression analysis for predicting specific chemical properties of molecular graphs [10,11]. The degree-based entropy measures studied and widely applied in graph theory are considered information functionals in the study of networks. The applications of entropy network measures range from the description of the structure of a molecule quantitatively to the exploration of biological and chemical features of molecular graphs. Presently, very few articles in the literature demonstrate the computation of neighbourhood sum degree-based M-Polynomial and neighbourhood sum degree-based entropy measures. Hence, this article is primarily concerned with computing the neighbourhood sum degree-based M-Polynomial and neighbourhood sum degree-based entropy measures for three prominent structures: graphene, graphyne and graphdiyne. This computation has not been conducted for these structures yet. Therefore, the computed results will provide a unique viewpoint for researchers to study these structures. The findings can also be extended to other large structures with a similar structural base.
2. Results
2.1. Mathematical Concepts
Throughout this research, we consider only a simple and connected graph without multiple edges and self-loops. The graph is said to be a connected graph with vertex set and edge set . The degree of the vertex is represented as .
2.2. Neighbourhood Degree Sum-Based Indices
The neighbourhood sum degree-based TIs are denoted by . The neighbourhood sum degree of the molecular graph is represented as . The denotes the sum of the degrees of the neighbouring vertices of . Let us define the neighbourhood sum degree-based -polynomial of ,
The degree-based TIs and neighbourhood degree sum-based (ND) TIs are depicted as [10,11]
and
The derivations of -Polynomial are listed below in Table 1.
Table 1.
-Polynomial Expressions.
3. Neighbourhood Degree Sum-Based Entropy Measures
In his seminal work, Shannon defined entropy as a measure of the unpredictable nature of relevant information or a way of measuring a system’s uncertainty. This paper laid the foundation for modern information theory. The entropy formulae have been used to quantify a network’s structural informativeness [12]. Though information theory was initially used exclusively in electrical engineering and linguistics, its versatile nature found applications in life sciences like chemistry and biology [13] and in graph theory for chemical networks. The notion of graph entropy was proposed to quantify the topological information of chemical networks and graphs.
Rashevsky [14] developed the concept of graph entropy depending on the vertex orbits. The graph entropy measures enable mathematicians to relate graph components such as edges and vertices with probability distributions, categorised as intrinsic and extrinsic measures. Graph entropies have wide-ranging applications in many fields, including chemistry, ecology, sociology, and biology [15,16]. Dehmer introduced graph entropies that captured structural information based on information functionals and studied their properties [17,18]. Estrada et al. [19] introduced a physically-sound graph entropy measure and analysed the walk-based graph entropies [20]. The applications of entropy network measures range from quantitatively describing a molecular structure to exploring biological and chemical features of molecular graphs. Entropy measures have several applications in the field of chemical graph theory. They are used to analyse complex networks and their chemical properties.
Let be a graph with vertex and be the degree of for the given edge , then one can define
where be the weight of the edge and . The node entropy is defined as
For an edge-weighted graph , the entropy measure of Γ is defined as [21]
where
where .
4. Computing the Neighbourhood Sum Degree-Based M-polynomial for β-Graphene
In this section, the proper analytical expressions of neighbourhood degree sum-based indices and entropy measures are computed using the M-polynomial for β-Graphene. Graphene is a carbon allotrope, a two-dimensional hexagonal network in which the carbon atoms form vertices with sp2 hybridisation. Graphene has many exceptional properties, including mechanical strength, optical transparency, and electric and thermal conductivity. Furthermore, the one-atomic layer structure of graphene makes it ultralight and super thin. Graphene has a thickness of about 0.35 nm, which is approximately 1/200,000th of the thickness of human hair. However, the closely arranged carbon atoms and the sp2 orbital hybridisation provide exceptional stability to the graphene structure. Thus, graphene shows extraordinary transparency of 97.7 percent, which means that it only absorbs 2.3 percent of visible light [22].
Due to its high conductivity, graphene can provide a possible alternative to many common substances used as membranes, including indium tin oxide (ITO) and fluorine-doped tin oxide (FTO). The use of graphene for these applications could address the issues of limited indium resources, pollution, and fragility. A membrane with graphene as the primary component could be used as a window barrier in dye-sensitised LEDs and solar cells. It is also possible for graphene to also exist as a nanoribbon in which a lateral charge movement causes an energy barrier to form close to the central point. A reduction in the thickness of the nanoribbon raises this energy barrier. [23]. Hence, by carefully adjusting the width of the graphene nanoribbon, the energy barrier can be accurately regulated, which is a promising advantage for graphene-based electronic devices. Graphene can also be used in the partial detection of external magnetic fields, electric fields, and deformations due to it being a low-noise electrical substance [24].
In terms of its structure, graphene can be considered the basic unit of graphite, fullerene [25], carbon nanotube [26], graphyne [27], and other related materials such as amorphous carbon, carbon fibre, charcoal [28], as well as aromatic molecules such as polycyclic aromatic hydrocarbons. As they all have the same structure, they all have some properties in common, even though their different sizes and shapes make them very different. Thus, the structural study of graphene helps to understand the above-listed materials. It can be observed from Figure 1 that the -Graphene contains seven graphene layers stacked next to each other. In three dimensions, the -Graphene contains seven layers stacked on top of each other. Thus, it can be inferred that the -Graphene consists of vertex set and edge set .
Figure 1.
-Graphene (7,7).
Theorem 1.
Ifis a β-Graphene system, then-polynomial ofis given as follows
Theorem 2.
Ifis a β-Graphene system, then-polynomial ofis given as follows
- 1.
- ,
- 2.
- ,
- 3.
- ,
- 4.
- ,
- 5.
- ,
- 6.
- ,
- 7.
- ,
- 8.
- ,
- 9.
- 10.
- 11.
- ,
- 12.
- 13.
- ,
- 14.
Proof of Theorem 2.
Let
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
.
The above results are obtained by using the conditions of M-Polynomial with its derivatives, and the partition Table 2. □
Table 2.
Partition table for -Graphene.
5. Neighbourhood Degree Sum-Based Entropy Measures for β-Graphene
Theorem 3.
Ifis a β-Graphene system, then-entropy measures ofare given as follows
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
where and can be represented as , , and .
6. Comparative Analysis for β-Graphene
In this section, the analytical expressions of the neighbourhood degree sum-based indices derived from Theorem 2 and Theorem 3 are represented as 3D plots. These plots help the reader visually interpret and understand the behaviour of the indices with respect to the variables that define the molecular structure. In addition, the results of Theorem 2 have also been represented as comparison plots where all the neighbourhood degree sum-based indices are plotted in the same graph against the same structural variables. These comparison plots provide a graphical representation of how the indices vary with respect to each other and the molecular structure. These plots are presented in Figure 2 and Figure 3. The numerical values of the indices are computed and listed in Table 3, Table 4, Table 5 and Table 6. The numerical values are represented as 3D plots in Figure 3, Figure 4, Figure 5, and Figure 6 respectively to provide a visual understanding to the readers.
Figure 2.
3D plots for Theorem 2.
Figure 3.
3D Plots for Table 3.
Table 3.
Comparison Table for Theorem 2.
Table 4.
Comparison Table for Theorem 2.
Table 5.
Comparison Table for Theorem 3.
Table 6.
Comparison Table for Theorem 3.
Figure 4.
3D Plots for Table 4.
Figure 5.
3D Plots for Table 5.
Figure 6.
3D Plots for Table 6.
7. Neighbourhood Degree Sum-Based M-Polynomial for β-Graphyne
Graphyne is a type of graphene in which the hexagons are connected by acetylenic bonds, as shown in Figure 1. Graphyne is especially intriguing because its distinct electronic structure sets it apart from other commonly available carbon allotropes, such as diamond and graphite. Furthermore, adding transition metals to graphyne sheets significantly affects the material’s general behaviour [29]. For example, the adsorption of chromium and iron transforms graphyne from a semiconductor into a spin-polarised metal. Other transition metal adsorption can produce a spin-polarised half semiconductor or a narrow gap semiconductor.
Computational studies demonstrate that the band gap of graphyne is mechanically adjustable, which facilitates the fabrication of transistors with various characteristics that are directly linked to the band gap. It also allows for the determination of these properties much later in the manufacturing process when compared to conventional semiconductors, where the properties are controlled based on doping [30,31,32].
Moreover, research has revealed that graphyne possesses peculiar optical properties. Although graphyne has not yet been successfully synthesised, its properties can be used in a variety of applications, including anisotropic conductors, nanofillers, desalinators, semiconductor metal hybrids, transistors, and sensors. The mechanical properties of graphyne enable its use as a nanofiller in composite materials. A sizeable elastic strain region of graphyne also makes it possible to drastically alter the material and revert it to its original shape without lasting damage [32]. This property allows for resilient electromechanical coupling, which is advantageous for many applications, including temperature sensing. The cardinality of -Graphynes is and . It is represented in Figure 7. The edge partitions for the -Graphynes are presented in Table 7.
Figure 7.
-Graphyne (7,7).
Table 7.
Partition Table for - Graphyne.
Theorem 4.
Ifis a β- graphyne system, then-polynomial ofis given as follows
Proof.
Let
Theorem 5.
Ifis a β- graphyne system, then-polynomial ofis given as follows
- 1.
- 2.
- ,
- 3.
- ,
- 4.
- ,
- 5.
- ,
- 6.
- ,
- 7.
- ,
- 8.
- ,
- 9.
- ,
- 10.
- ,
- 11.
- ,
- 12.
- ,
- 13.
- ,
- 14.
- .
8. Computing Neighbourhood Degree Sum-Based Entropy Measures for β-graphyne
Theorem 6.
Ifis a β-Graphyne system, then-entropy measures ofare given as follows
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
where and .
The closed-form expressions of the neighbourhood degree sum-based indices computed in Theorem 5 and Theorem 6 are represented as 3D plots in this section. These graphical representations provide a visual interpretation of the mathematical expressions to study the indices with respect to the molecular structure. In addition, the results of Theorem 2 have also been represented as comparison plots to understand the behaviour of the indices with respect to each other. These plots are presented in Figure 8, Figure 9, Figure 10, Figure 11 and Figure 12.

Figure 8.
3D plots for theorem 5.
Figure 9.
3D plots for Table 8.
Table 8.
Comparison Table for Theorem 5.
Figure 10.
3D plots for Table 9.
Table 9.
Comparison Table for Theorem 5.
Figure 11.
3D plots for Table 10.
Table 10.
Comparison Table for Theorem 6.
Figure 12.
3D plots for Table 11.
Table 11.
Comparison Table for Theorem 6.
9. Neighbourhood Degree Sum-Based M-polynomial and Entropy Measures for β-Graphdiyne
Graphdiyne, a recently developed two-dimensional carbon allotrope, has been gaining prominence. This carbon allotrope has gained increasing interest due to its intriguing electronic properties, including high mobility and conductivity, good field emission properties, and a tunable natural band gap, in addition to its distinctive porous structure. It is predicted to have good application prospects in a variety of fields, including gas separation, catalysis, water remediation, humidity sensor, and energy-related fields [33]. It consists of and . β-Graphdiyne is represented in Figure 13. The edge partitions of β-Graphdiyne are presented in Table 12.
Figure 13.
-Graphdiyne (7,7).
Table 12.
Partition Table for -Graphdiyne.
Recently, Julietraja and Venugopal [34] studied degree-based indices using M-Polynomials for a coronoid system. Chu et al. [35] studied degree-and irregularity-based indices for benzenoids. Julietraja et al. [36] investigated degree-based indices for certain classes of benzenoid systems. Julietraja et al. [37] investigated degree-based indices for a donut-benzenoid system. Julietraja et al. [38] investigated irregularity-based indices for PAHs. Liu et al. [39] studied the network coherence analysis on a family of nested weighted N-Polygon networks. Liu et al. [40] studied the analyses of some structural properties on a class of hierarchical scale-free networks. Liu et al. [41] studied minimizing the Kirchhoff index among graphs with a given vertex bipartiteness. Liu et al. [42] studied the Zagreb indices and multiplicative Zagreb indices of Eulerian Graphs. Liu et al. [43] studied the valency-based topological descriptors and structural properties of the generalized Sierpinski networks. Liu et al. [44] studied the Kirchhoff index and spanning trees of the Möbius/cylinder octagonal chain.
Theorem 7.
Ifis a β- graphdiyne system, then-polynomial ofis given as follows
Proof.
Let
Theorem 8.
Ifis a β- graphdiyne system, then-entropy measures ofare given as follows
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
10. Neighbourhood Degree Sum-Based Entropy Measures for β-Graphdiyne
Theorem 9.
Ifis a β- graphdiyne system, then-entropy measures ofare given as follows
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
where , , and .
In this section, the neighbourhood degree sum-based indices computed in Theorem 8 and Theorem 9 are plotted as 3D graphs to provide a visual tool for understanding the behavioural pattern of the indices for changing molecular structures. In addition, the results of Theorem 8 have also been presented as comparison plots in Figure 14 to study the behaviour of the indices with respect to each other and the molecular structure. The numerical values of the indices are computed and listed in Table 13, Table 14, Table 15 and Table 16. The numerical values are represented as 3D plots in Figure 15, Figure 16, Figure 17, and Figure 18 respectively to provide a visual understanding to the readers.
Figure 14.
3D plots for theorem 8.
Table 13.
Comparison Table for Theorem 8.
Table 14.
Comparison Table for Theorem 8.
Table 15.
Comparison Table for Theorem 9.
Table 16.
Comparison Table for Theorem 9.
Figure 15.
3D plots for Table 13.
Figure 16.
3D plots for Table 14.
Figure 17.
3D plots for Table 15.
Figure 18.
3D plots for Table 16.
11. Conclusions
In this article, the closed-form analytical expressions of neighbourhood sum degree-based indices of three types of graphenes have been derived using the M-Polynomial. The computed indices are presented as individual 3D plots and comparison plots for a convenient interpretation of the mathematical expressions. The neighbourhood sum degree-based entropy measures have also been calculated for the three types of graphene structures. These indices are also visualised as 3D plots to corroborate the dependence of the indices on the underlying molecular structure. These indices have not been studied before for these structures; hence, this study is one of a kind. This study will enable future researchers to explore more topological indices for these fascinating structures.
Author Contributions
Conceptualization, J.K. and A.A.R.S.; methodology, J.K.; software, J.K.; validation, J.K., and A.A.R.S.; investigation, A.A.R.S. and J.K.; writing—original draft preparation, J.K.; writing—review and editing, J.K.; visualization, J.Y.; supervision, J.Y.; funding acquisition, J.Y. All authors have read and agreed to the published version of the manuscript.
Funding
The Authors would like to thank the “Doctoral research funds of Chaohu University 2023”.
Institutional Review Board Statement
Not Applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
No data associated in the manuscript.
Acknowledgments
The Authors would like to thank the “Doctoral research funds of Chaohu University 2023”.
Conflicts of Interest
The authors declare no conflict of interest.
Sample Availability
Not applicable.
References
- Diudea, M.V. QSPR/QSAR Studies by Molecular Descriptors; Nova Science Publishers: Huntington, NY, USA, 2001. [Google Scholar]
- Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
- Mehraein, I.; Riahi, S. The QSPR models to predict the solubility of CO2 in ionic liquids based on least-squares support vector machines and geneticalgorithm-multi linear regression. J. Mol. Liq. 2017, 225, 521–530. [Google Scholar] [CrossRef]
- Sola, M. Forty years of Clar’s aromatic p-sextet rule. Front. Chem. 2013, 1, 22. [Google Scholar] [CrossRef] [PubMed]
- Toropov, A.A.; Toropova, A.P. Method of ideal symmetry in four-dimensional space: Implementation in the QSPR studies on the thermochemistry of complex compounds. Russ. J. Coord. Chem./Koord. Khimiya 1997, 23, 741–747. [Google Scholar]
- Ivanciuc, O. Chemical graphs, molecular matrices and topological indices in chemoinformatics and quantitative structure-activity relationships. Curr. Comput.-Aided Drug Des. 2013, 9, 153–163. [Google Scholar] [CrossRef]
- Hosoya, H. On some counting polynomials in chemistry. Discret. Appl. Math. 1988, 19, 239–257. [Google Scholar] [CrossRef]
- Deutsch, E.; Klavžar, S. M-polynomial and degree-based topological indices. Iran. J. Math. Chem. 2015, 6, 93–102. [Google Scholar]
- Rahul, M.P.; Clement, J.; Junias, J.S.; Arockiaraj, M.; Balasubramanian, K. Degree-based entropies of graphene, graphyne and graphdiyne using Shannon’s approach. J. Mol. Struct. 2022, 1260, 132797. [Google Scholar] [CrossRef]
- Mondal, S.; Dey, A.; De, N.; Pal, A. QSPR analysis of some novel neighbourhood degree-based topological descriptors. Complex Intell. Syst. 2021, 7, 977–996. [Google Scholar] [CrossRef]
- Mondal, S.; De, N.; Pal, A. Topological properties of Graphene using some novel neighborhood degree-based topological indices. Int. J. Math. Ind. 2019, 11, 1950006. [Google Scholar] [CrossRef]
- Sole, R.V.; Valverde, S. Information theory of complex networks: On evolution and architectural constraints. Complex Netw. 2004, 650, 189–207. [Google Scholar]
- Morowitz, H.J. Some order-disorder considerations in living systems. Bull. Math. Biophys. 1955, 17, 81–86. [Google Scholar] [CrossRef]
- Rashevsky, N. Life, information theory, and topology. Bull. Math. Biophys. 1955, 17, 229–235. [Google Scholar] [CrossRef]
- Dehmer, M.; Grabner, M. The discrimination power of molecular identification numbers revisited. MATCH Commun. Math. Comput. Chem. 2013, 69, 785–794. [Google Scholar]
- Ulanowicz, R.E. Quantitative methods for ecological network analysis. Comput. Biol. Chem. 2004, 28, 321–339. [Google Scholar] [CrossRef] [PubMed]
- Dehmer, M. Information processing in complex networks: Graph entropy and information functionals. Appl. Math. Comput. 2008, 201, 82–94. [Google Scholar] [CrossRef]
- Dehmer, M.; Sivakumar, L.; Varmuza, K. Uniquely discriminating molecular structures using novel eigenvalue-based descriptors. MATCH Commun. Math. Comput. Chem. 2012, 67, 147–172. [Google Scholar]
- Estrada, E.; Patlewicz, G.; Uriarte, E. From molecular graphs to drugs. A review on the use of topological indices in drug design and discovery. Indian J. Chemistry Sect. A: Inorg. Phys. Theor. Anal. 2003, 42, 1315–1329. [Google Scholar]
- Estrada, E. Generalised walks-based centrality measures for complex biological networks. J. Theor. Biol. 2010, 263, 556–565. [Google Scholar] [CrossRef]
- Kazemi, R. Entropy of weighted graphs with the degree-based topological indices as weights. MATCH Commun. Math. Comput. Chem. 2016, 76, 69–80. [Google Scholar]
- Nair, R.R.; Blake, P.; Grigorenko, A.N.; Novoselov, K.S.; Booth, T.J.; Stauber, T.; Peres, N.M.; Geim, A.K. Fine structure constant defines visual transparency of graphene. Science 2008, 320, 1308. [Google Scholar] [CrossRef] [PubMed]
- Son, Y.W.; Cohen, M.L.; Louie, S.G. Energy gaps in graphene nanoribbons. Phys. Rev. Lett. 2006, 97, 216803. [Google Scholar] [CrossRef] [PubMed]
- Wang, Z.F.; Shi, Q.W.; Li, Q.; Wang, X.; Hou, J.G.; Zheng, H.; Yao, Y.; Chen, J. Z-shaped graphene nanoribbon quantum dot device. Appl. Phys. Lett. 2007, 91, 053109. [Google Scholar] [CrossRef]
- Kroto, H.W.; Health, J.R.; O’Brien, S.C.; Curl, R.F.; Smalley, R.E. C60: The third man, Buckminsterfullerene. Nature 1985, 318, 162–163. [Google Scholar] [CrossRef]
- Iijima, Y. Helical microtubules of graphitic carbon. Nature 1991, 354, 56–58. [Google Scholar] [CrossRef]
- Heimann, R.B.; Evsvukov, S.E.; Koga, Y. Carbon allotropes: A suggested classification scheme based on valence orbital hybridization. Carbon 1997, 35, 1654–1658. [Google Scholar] [CrossRef]
- Hoffmann, R.; Kabanov, A.A.; Golov, A.A.; Proserpio, D.M. Homo citans and carbon allotropes: For an ethics of citation. Angew. Chem. 2016, 55, 10962–10976. [Google Scholar] [CrossRef]
- He, J.; Ma, S.Y.; Zhou, P.; Zhang, C.X.; He, C.; Sun, L.Z. Magnetic properties of single transition-metal atom absorbed graphdiyne and graphyne sheet from DFT + U calculations. J. Phys. Chem. C 2012, 116, 26313–26321. [Google Scholar] [CrossRef]
- Gholami, M.; Melin, F.; Mcdonald, R.; Ferguson, M.J.; Echegoyen, L.; Tykwinski, R.R. Synthesis and characterization of expanded radialenes, bisradialenes, and radiaannulenes. Angew. Chem. Int. Ed. Engl. 2007, 46, 9081–9085. [Google Scholar] [CrossRef]
- Haley, M.M. Synthesis and properties of annulenic subunits of graphyne and graphdiyne nanoarchitectures. Pure Appl. Chem. 2008, 80, 519–532. [Google Scholar] [CrossRef]
- Peng, Q.; Dearden, A.K.; Crean, J.; Han, L.; Liu, S.; Wen, X.; De, S. New materials graphyne, graphdiyne, graphone, and graphane: Review of properties, synthesis, and application in nanotechnology. Nanotechnol. Sci. Appl. 2014, 7, 1. [Google Scholar] [CrossRef] [PubMed]
- Gao, X.; Liu, H.; Wang, D.; Zhang, J. Graphdiyne: Synthesis, properties, and applications. Chem. Soc. Rev. 2019, 48, 908–936. [Google Scholar] [CrossRef] [PubMed]
- Julietraja, K.; Venugopal, P. Computation of degree-based topological descriptors using M-polynomial for coronoid systems. Polycycl. Aromat. Compd. 2020, 42, 1–24. [Google Scholar] [CrossRef]
- Chu, Y.M.; Julietraja, K.; Venugopal, P.; Siddiqui, M.K.; Prabhu, S. Degree-and irregularity-based molecular descriptors for benzenoid systems. Eur. Phys. J. Plus 2021, 136, 1–17. [Google Scholar] [CrossRef]
- Julietraja, K.; Venugopal, P.; Prabhu, S.; Liu, J.B. M-polynomial and degree-based molecular descriptors of certain classes of benzenoid systems. Polycycl. Aromat. Compd. 2020, 42, 3450–3477. [Google Scholar] [CrossRef]
- Julietraja, K.; Venugopal, P.; Prabhu, S.; Deepa, S.; Siddiqui, M.K. Molecular structural descriptors of donut benzenoid systems. Polycycl. Aromat. Compd. 2021, 1–27. [Google Scholar] [CrossRef]
- Julietraja, K.; Venugopal, P.; Chellamani, P. Topological analysis of PAHs using irregularity based indices. Biointerface Res. Appl. Chem. 2021, 12, 2970–2987. [Google Scholar]
- Liu, J.B.; Bao, Y.; Zheng, W.-T.; Hayat, S. Network coherence analysis on a family of nested weighted N-polygon networks. Fractals 2021, 29, 2150260. [Google Scholar] [CrossRef]
- Liu, J.B.; Bao, Y.; Zheng, W.-T. Analyses of some structural properties on a class of hierarchical scale-free networks. Fractals 2022, 30, 2250136. [Google Scholar] [CrossRef]
- Liu, J.B.; Pan, X.F. Minimizing Kirchhoff index among graphs with a given vertex bipartiteness. Appl. Math. Comput. 2016, 291, 84–88. [Google Scholar]
- Liu, J.B.; Wang, C.; Wang, S. Zagreb indices and multiplicative Zagreb indices of Eulerian graphs. Bull. Malays. Math. Sci. Soc. 2019, 42, 67–78. [Google Scholar] [CrossRef]
- Liu, J.B.; Zhao, J.; He, H.; Shao, Z. Valency-based topological descriptors and structural property of the generalized Sierpinski networks. J. Stat. Phys. 2019, 177, 1131–1147. [Google Scholar] [CrossRef]
- Liu, J.B.; Zhang, T.; Wang, Y.K.; Lin, W.S. The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain. Discret. Appl. Math. 2022, 307, 22–31. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).