This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
1. Introduction
Chemical graph theory is used to mathematically model molecules in order to review their physical properties. It is also a good idea to characterize chemical structures. Chemical graph theory could be a mathematical branch that combines graph theory and chemistry.
Topological indices are molecular descriptors that can be used to describe these characteristics and specific chemical graphs [1]. The topological index of a chemical composition is a numerical value or continuation of a given structure under consideration that indicates chemical, physical, and biological properties of a chemical molecule structure [2].
It also belongs to a category of nontrivial chemical graph theory applications for exact molecular problem solutions. This theory is essential in the field of chemical sciences and chemical graph theory. More information is on quantity structure activity relationship (QSAR) and quantity structure property relationship (QSPR), which are used to predict biobiota and physicochemical properties in chemical compounds [3, 4].
In this article,
2. Literature Review
In 2013, Ranjini et al. [7] introduced redefined version of Zagreb indices
In 2010, Ghorbani and Hosseinzadeh [8] introduced the fourth version of the atom-bond connectivity index
In 2011, Graovac et al. [9] introduced the fifth version of the geometric arithmetic index GA5 of a graph G as
In 2017, Hosamani introduced the Sanskruti index [10]
Shannon first introduced the idea of entropy in his famous article [12] in 1948. The unpredictability of information content or the uncertainty of a system is measured by the entropy of a probability distribution. Later on, entropy was applied to graphs and chemical networks and it was developed to better understand the structural information in these networks. Graph entropies have recently gained popularity in fields such as biology, chemistry, ecology, and sociology to name a few. Degree of every atom is extremely important; graph theory and network theory have both conducted extensive research on invariants, which are used as information functionals in science and have been around for a long time. In the following paragraphs, we will go over graph entropy measures that have been used to investigate biological and chemical networks in chronological order [13–15].
In this article, we construct the non-Kekulean benzenoid graph
3. Applications of Entropy
In information theory, the graph entropy is a crucial quantity. It analyses chemical graphs and complex networks for structural information. Distance-based entropy is playing an important role in various forms including different problems in math, biology, chemical graph theory, organic chemistry. The graph is inserted with a topological index by Shannon’s entropy concept and topological indices as molecular descriptors are important tools in (QSAR)/(QSPR) study. Shannon’s seminal work [16] was published in 1948, marking the beginning of modern information theory. Information theory was widely used in biology and chemistry after its early applications in linguistics and electrical engineering (see, for example, in 1953, [17]). Shannon’s entropy formulas [16] were used to figure out a network’s structural information content in 2004 [18].
The work of Rashevsky in 1955 [19] and Trucco in 1956 [20] is closely related to these applications. The following sections go over graph entropy measures that have been used to study biological and chemical networks in chronological order. Entropy measures for graphs have also been widely used in biology, computer science, and structural chemistry (for example, in 2011, see [21]). Entopic network measures have a wide range of applications, ranging from quantitative structure characterization in structural chemistry to exploring biological or chemical properties of molecular graphs in general. We stress that the aforementioned applications are intended to solve a fundamental data analysis problem, such as clustering or classification. We hypothesise that the degree-based entropy introduced in this paper can be used to assess non-Kekulean benzenoid graph.
4. Degree-Based Entropy
In 2014, Chen et al. [22] proposed the definition of entropy of an edge-weighted graph
By the help of equation 7, other entropies were found [6] and mathematically denoted as follows:
(i) First redefined Zagreb entropy:
Let
Now, by using these values in (7), the first redefined Zagreb entropy is
(ii) Second redefined Zagreb entropy:
Let
Now, by using these values in (7), the second redefined Zagreb entropy is
(iii) Third redefined Zagreb entropy:
Let
Now, by using these values in (7), the third redefined Zagreb entropy is
(iv) Entropy of fourth atom-bond connectivity:
Let
Here,
(v) Fifth geometry arithmetic entropy:
Let
Now, by using these values in (7), the fifth geometric arithmetic entropy is
(vi) Sanskruti entropy:
Let
Now, by using these values in equation (7), the Sanskruti entropy is
The Kekulean and non-Kekulean structures of benzene are real and distinct due to the presence of rings in the benzenoid form. The specific arrangement of rings in the benzenoid system provides the transformation in series of benzenoid structures of the benzenoid graph that is the way the structures are changed. In the series of concealed non-Kekulean benzenoid graph
Following are the three figures of non-Kekulean benzenoid graphs
According to the degree of the atoms, there are three types of atom-bonds in
(vii) First redefined Zagreb entropy of
Let
Now, we are computing the first redefined Zagreb entropy by using Table 1 and (22) in (9) in the following way:
After simplification, in the following equation, we get the actual amount of the first redefined Zagreb entropy.
(viii) Second redefined Zagreb entropy of
Let
Now, we are computing the second redefined Zagreb entropy by using Table 1 and (25) in (11) in the following way:
After simplification, we get the actual amount of second redefined Zagreb entropy in the following equation:
(ix) Third redefined Zagreb entropy of
Let
Now, we are computing the third redefined Zagreb entropy by using Table 1 and (28) in (13) in the following way:
The above (29) is the actual amount of third redefined Zagreb entropy.
(x) Fourth atom-bond connectivity entropy of
Table 2 shows the atom-bond-based partition of non-Kekulean graph
Let
Now, we are computing the fourth atom-bond connectivity entropy by using Table 2 and (30) in (15) in the following way:
After simplification, we get the exact value of forth atom-bond connectivity entropy
(xi) Fifth geometry arithmetic entropy of
Let
Now, we are computing the fifth geometry arithmetic entropy of
By using the value of fifth geometry arithmetic index in the above expiration, we get the exact value of fifth geometry arithmetic entropy of
(xii) Sanskruti entropy of
Let
Now, we are computing Sanskruti entropy by using (36) and Table 2 in (17) in the following way:
We get the actual amount of Sanskruti entropy of
[figure(s) omitted; refer to PDF]
Table 1
Atom-bonds-based partition of each atom of
Types of atom-bonds | |||
Frequency of atom-bonds | 8 |
Table 2
Edge partition (sum of valency of the neighborhood atoms).
Number of atom-bonds | |
8 | |
8 | |
4 | |
2 | |
4 | |
5. Numerical and Graphical Representation
The numerical representation and the graphical representation are dedicated in Figure 2. We can easily see, from Figure 2, that all indices are in increasing order as the value of
[figure(s) omitted; refer to PDF]
6. Conclusion
For the construction of entropy-based measures to characterize the structure of complex networks, many graph invariants have been used. We study graph entropies based on vertex degrees using so-called information functionals, which are based on Shannon’s entropy. There has been very little work done to find the extremal values of Shannon entropy-based graph measures. The main contribution of this paper is to prove some extreme values for the key focus area entropy of certain non-Kekulean benzenoid graph. In this research, we investigate the graph entropies associated with a new information function using Shannon’s entropy and Chen et al’s entropy definitions and evaluate a relationship between degree-based topological indices and degree-based entropies. The degree-based entropies for crystallographic structures of non-Kekulean benzenoid graph
In the future, we hope to expand this concept to include various chemical structures with the help of chemists, allowing researchers to pursue new avenues in this field.
Authors’ Contributions
The authors contributed equally in the analysis and write up of the manuscript.
Acknowledgments
The authors are very thankful to the Jahangirnagar University, Savar, Dhaka, Bangladesh, for supporting this work.
[1] P. C. S. Costa, J. S. Evangelista, I. Leal, P. C. M. L. Miranda, "Chemical graph theory for property modeling in QSAR and QSPR-charming QSAR & QSPR," Mathematics, vol. 9 no. 1,DOI: 10.3390/math9010060, 2020.
[2] N. Salamat, M. Kamran, S. Ali, M. Alam, R. H. Khan, "Several characterizations on degree-based topological indices for star of david network," Journal of Mathematics, vol. 2021,DOI: 10.1155/2021/9178444, 2021.
[3] S. Ediza, I. iftia, Z. Tasb, M. Cancana, M. Reza, "A Note on QSPR Analysis of Total Zagreb and Total Randic Indices of Octanes," Eurasian Chemical Communications, vol. 3, pp. 139-145, 2021.
[4] L. Fu, Z. Y. Yang, Z. J. Yang, M. Z. Yin, A. P. Lu, X. Chen, S. Liu, T. J. Hou, D. S. Cao, "QSAR-assisted-MMPA to expand chemical transformation space for lead optimization," Briefings in Bioinformatics, vol. 22 no. 5,DOI: 10.1093/bib/bbaa374, 2021.
[5] A. Ali, K. C. Das, D. Dimitrov, B. Furtula, "Atombond connectivity index of graphs: a review over extremal results and bounds," Discrete Mathematics Letters, vol. 5 no. 1, pp. 68-93, 2021.
[6] S. Manzoor, M. K. Siddiqui, S. Ahmad, "On entropy measures of molecular graphs using topological indices," Arabian Journal of Chemistry, vol. 13 no. 8, pp. 6285-6298, DOI: 10.1016/j.arabjc.2020.05.021, 2020.
[7] P. S. Ranjini, V. Lokesha, A. Usha, "Relation between phenylene and hexagonal squeeze using harmonic index," International Journal of Graph Theory, vol. 1 no. 4, pp. 116-121, 2013.
[8] S. M. Hosamani, "Computing sanskruti index of nanostructures," Journal Applied Mathematics and Computing, vol. 54, 2016.
[9] A. Graovac, M. Ghorbani, M. A. Hosseinzadeh, "Computing fifth geometric-arithmetic index for nanostar dendrimers," Journal of Mathematical Nanoscience, vol. 1 no. 1-2, pp. 33-42, 2011.
[10] S. M. Hosamani, "Computing Sanskruti index of certain nanostructures," Journal of Applied Mathematics and Computing, vol. 54 no. 1, pp. 425-433, DOI: 10.1007/s12190-016-1016-9, 2017.
[11] M. Javaid, U. Amin, A. Raheem, "Extremal unicyclic graphs with respect to the Sanskruti index," Asian-European Journal of Mathematics, vol. 14 no. 01,DOI: 10.1142/s1793557120501478, 2021.
[12] C. E. Shannon, "A mathematical theory of communication," Bell System Technical Journal, vol. 27 no. 3, pp. 379-423, DOI: 10.1002/j.1538-7305.1948.tb01338.x, 1948.
[13] W. Huang, Y. Zhang, Y. Yu, Y. Xu, M. Xu, R. Zhang, G. J. De Dieu, D. Yin, Z. Liu, "Historical data-driven risk assessment of railway dangerous goods transportation system: comparisons between Entropy Weight Method and Scatter Degree Method," Reliability Engineering & System Safety, vol. 205,DOI: 10.1016/j.ress.2020.107236, 2021.
[14] K. Julietraja, P. Venugopal, S. Prabhu, A. K. Arulmozhi, M. K. Siddiqui, "Structural analysis of three types of PAHs using entropy measures," Polycyclic Aromatic Compounds,DOI: 10.1080/10406638.2021.1884101, 2021.
[15] C.-X. Nie, F.-T. Song, "Entropy of graphs in financial markets," Computational Economics, vol. 57 no. 4, pp. 1149-1166, DOI: 10.1007/s10614-020-10007-3, 2021.
[16] C. E. Shannon, "A mathematical theory of communication," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 5 no. 1,DOI: 10.1145/584091.584093, 2001.
[17] H. J. Morowitz, "Some order-disorder considerations in living systems," Bulletin of Mathematical Biophysics, vol. 17 no. 2, pp. 81-86, DOI: 10.1007/bf02477985, 1955.
[18] R. V. Solé, S. Valverde, "Information theory of complex networks: on evolution and architectural constraints," Complex Networks, pp. 189-207, DOI: 10.1007/978-3-540-44485-5_9, 2004.
[19] N. Rashevsky, "Life, information theory, and topology," Bulletin of Mathematical Biophysics, vol. 17 no. 3, pp. 229-235, DOI: 10.1007/bf02477860, 1955.
[20] E. Trucco, "A note on the information content of graphs," Bulletin of Mathematical Biophysics, vol. 18 no. 2, pp. 129-135, DOI: 10.1007/bf02477836, 1956.
[21] M. Dehmer, A. Mowshowitz, "A history of graph entropy measures," Information Sciences, vol. 181 no. 1, pp. 57-78, DOI: 10.1016/j.ins.2010.08.041, 2011.
[22] Z. Chen, M. Dehmer, Y. Shi, "A note on distance-based graph entropies," Entropy, vol. 16 no. 10, pp. 5416-5427, DOI: 10.3390/e16105416, 2014.
[23] M. Ibrahim, N. Zahra, M. K. Siddiqui, "On ve-degree and ev-degree based topological indices for the series of benzenoid graphs," Polycyclic Aromatic Compounds,DOI: 10.1080/10406638.2021.1926294, 2021.
[24] A. Amrullah, A. Syahrul, M. Turmuzi, K. Baidowi, K. Nani, "The bridge graphs partition dimension," Journal of Physics: Conference Series, vol. 1779 no. 1,DOI: 10.1088/1742-6596/1779/1/012086, 2021.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Copyright © 2022 Md. Ashraful Alam et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0/
Abstract
Tessellations of kekulenes and cycloarenes have a lot of potential as nanomolecular belts for trapping and transporting heavy metal ions and chloride ions because they have the best electronic properties and pore sizes. The aromaticity, superaromaticity, chirality, and novel electrical and magnetic properties of a class of cycloarenes known as kekulenes have been the subject of several experimental and theoretical studies. Through topological computations of superaromatic structures with pores, we investigate the entropies and topological characterization of different tessellations of kekulenes. Using topological indices, the biological activity of the underlying structure is linked to its physical properties in (QSPR/QSAR) research. There is a wide range of topological indices accessible, including degree-based indices, which are used in this work. With the total
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details



1 Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh
2 Department of Mathematics, Khwaja Fareed University of Engineering & Information Technology, Rahim Yar Khan, Punjab 64200, Pakistan
3 Department of Mathematics and Statistics, Institute of Southern Punjab, Multan, Pakistan