Degree-Based Entropy for a Non-Kekulean Benzenoid Graph

Tessellations of kekulenes and cycloarenes have a lot of potential as nanomolecular belts for trapping and transporting heavymetal ions and chloride ions because they have the best electronic properties and pore sizes.e 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. rough topological computations of superaromatic structures with pores, we investigate the entropies and topological characterization of dierent tessellations of kekulenes. Using topological indices, the biological activity of the underlying structure is linked to its physical properties in (QSPR/QSAR) research. ere is a wide range of topological indices accessible, including degree-based indices, which are used in this work. With the total π-electron energy, these indices have a lot of iteration. In addition, we use graph entropies to determine the structural information of a non-Kekulean benzenoid graph. In this article, we study the crystal structure of non-Kekulean benzenoid graph Kn and then calculate some entropies by using the degree-based topological indices. We also investigate the relationship between degree-based topological indices and degree-based entropies. is relationship is very helpful for chemist to study the physicochemical characterization of non-Kekulean benzenoid chemical. ese numerical values correlate with structural facts and chemical reactivity, biological activities, and physical properties.


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 speci c chemical graphs [1]. e 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.
is theory is essential in the eld 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, G is the connected simple chemical structure, with V(G) vertices set and E(G) edges set. Degree of any vertex u is denoted by R(u). e edge between vertices u and v is denoted by uv. e total number of atoms linked to v j of G is denoted by d v j , and it is the atom-bond of every atom of G. If G is a graph which contains m atoms and n atom-bonds, then order of G, denoted by |G|, is m and the size of G denoted by S(G) is n. An alternating sequence of atoms and atom-bonds in a graph G is known as a path in G.
If there exists a path between every two atoms in G, then G is said to be a connected graph. A u i ∼ v j geodesic is the shortest path between two atoms u i and v j in a connected graph G. e number of atom-bonds (length) in a u i ∼ v j geodesic is called the distance between u i and v j , denoted by d(u i , v j ) for u i , v j ∈ V G , in a connected graph [5]. In this article, we construct the non-Kekulean benzenoid graph K n and computed the 1 st redefined Zagreb entropy, 2 nd redefined Zagreb entropy, 3 rd redefined Zagreb entropy, 4 th atom-bond connectivity entropy, 5 th geometry arithmetic entropy, and Sanskurti entropy by using their indices. We used the concept of entropy from Shazia Manzoor' article [6]. e huge amount of infirmations were missing for non-Kekulean benzenoid structure that we find in this paper. is information is much helpful for the chemists to study the physio-chemical properties of the non-Kekulean benzenoid structure.

Literature Review
In 2013, Ranjini et al. [7] introduced redefined version of Zagreb indices ReZG 1 , ReZG 2 , and ReZG 3 . ese are formulated as In 2010, Ghorbani and Hosseinzadeh [8] introduced the fourth version of the atom-bond connectivity index ABC 4 of a graph G and formulated as 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] S G for a molecular graph G as follows and have worked on it till now in 2021 [11], denoted by S(G), Shannon first introduced the idea of entropy in his famous article [12] in 1948. e 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][14][15].
In this article, we construct the non-Kekulean benzenoid graph K n and computed the 1 st redefined Zagreb entropy, 2 nd redefined Zagreb entropy, 3 rd redefined Zagreb entropy, 4 th atom-bond connectivity entropy, 5 th geometry arithmetic entropy, and Sanskurti entropy by using their indices. We used the concept of entropy from Shazia Manzoor' article [15].

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. e 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]. e work of Rashevsky in 1955 [19] and Trucco in 1956 [20] is closely related to these applications. e 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.

Degree-Based Entropy
In 2014, Chen et al. [22] proposed the definition of entropy of an edge-weighted graph G.
exemplify the set of vertices, the edge set, and the edgeweight of edge (u i v j ), respectively. e entropy of edgeweighted graph is defined as By the help of equation 7, other entropies were found [6] and mathematically denoted as follows: (i) First redefined Zagreb entropy: en, the first redefined Zagreb index (1) is given by Now, by using these values in (7), the first redefined Zagreb entropy is (ii) Second redefined Zagreb entropy: en, the second redefined Zagreb index (2) is given by Now, by using these values in (7), the second redefined Zagreb entropy is (iii) ird redefined Zagreb entropy: . en, the third redefined Zagreb index (3) is given by Now, by using these values in (7), the third redefined Zagreb entropy is (iv) Entropy of fourth atom-bond connectivity: en, the 4 th atom-bond connectivity index (4) is Journal of Mathematics Here, S u i is the neighborhood degree sum of vertex u i . Now, by using these values in (7), the third redefined Zagreb entropy is (v) Fifth geometry arithmetic entropy: en, the fifth geometry arithmetic index (4) is given by Now, by using these values in (7), the fifth geometric arithmetic entropy is (vi) Sanskruti entropy: . en, the Sanskruti index (6) is given by Now, by using these values in equation (7), the Sanskruti entropy is e Kekulean and non-Kekulean structures of benzene are real and distinct due to the presence of rings in the benzenoid form. e 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 K n , see [23], where n shows the number of bridges [24] in the center of K n , as shown in Figure 1. Similarly for n � k, there are k bridges. Here, in the non-Kekulean benzenoid graph K n , we observed that there are three types of atom-bonds on the basis of valency of every atom. erefore, by observing this concept of atom-bonds, there are two types of atoms v i and v j such that d v i � 2 and d v j � 3, where d v i and d v j mean the valency of atoms ∀ v i , v j ∈ K n . e order and size of non-Kekulean benzenoid graphs K n are V K n � 2(6n + 7), Following are the three figures of non-Kekulean benzenoid graphs K 3 , K 4 , and K 5 .
According to the degree of the atoms, there are three types of atom-bonds in K n : (2 ∼ 2), (2 ∼ 3), and (3 ∼ 3). e atom-bonds partition of K n is shown as (vii) First redefined Zagreb entropy of K n Let G be the non-Kekulean benzenoid graph K n . en, by using Table 1 in (1), the first redefined Zagreb index is 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.
ENT ReZG 1 K n � log 2(6n + 7) − 1 2(6n + 7) log 8 × 4(n + 3) 5 6 Number of bridges K 3 K 4 K 5 Figure 1: Non-Kekulean benzenoid graphs K n . Journal of Mathematics (viii) Second redefined Zagreb entropy of K n : Let G be the non-Kekulean benzenoid graph K n . en, by using Table 1 in (2), the second redefined Zagreb index is 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) ird redefined Zagreb entropy of K n : Let G be the non-Kekulean benzenoid graph K n , then by using Table 1 in (3), the third redefined Zagreb index is Now, we are computing the third redefined Zagreb entropy by using Table 1 and (28) in (13) in the following way: Table 2: Edge partition (sum of valency of the neighborhood atoms).
Let K n be a non-Kekulean benzenoid graph. en, by using Table 2 in (4), the forth atom-bond connectivity index is Now, we are computing the fourth atom-bond connectivity entropy by using Table 2 and (30) in (15) in the following way: (9,9) ��������� � After simplification, we get the exact value of forth atom-bond connectivity entropy

Numerical and Graphical Representation
e 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 n is increasing. Comparison of entropy for ENTABC 4 (K n ) and ENTGA 5 (K n ) is taken for n > 1.

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. ere has been very little work done to find the extremal values of Shannon entropy-based graph measures. e 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. e degree-based entropies for crystallographic structures of non-Kekulean benzenoid graph K n were calculated by their indices, which leads us to the physicochemical properties of the non-Kekulean benzenoid graph K n .
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.

Data Availability
No data were used to support this study.

Conflicts of Interest
e authors declare no conflicts of interest.

Authors' Contributions
e authors contributed equally in the analysis and write up of the manuscript.