Degree-Based Graph Entropy in Structure-Property Modeling
- PMID: 37510039
- PMCID: PMC10379043
- DOI: 10.3390/e25071092
Degree-Based Graph Entropy in Structure-Property Modeling
Abstract
Graph entropy plays an essential role in interpreting the structural information and complexity measure of a network. Let G be a graph of order n. Suppose dG(vi) is degree of the vertex vi for each i=1,2,…,n. Now, the k-th degree-based graph entropy for G is defined as Id,k(G)=-∑i=1ndG(vi)k∑j=1ndG(vj)klogdG(vi)k∑j=1ndG(vj)k, where k is real number. The first-degree-based entropy is generated for k=1, which has been well nurtured in last few years. As ∑j=1ndG(vj)k yields the well-known graph invariant first Zagreb index, the Id,k for k=2 is worthy of investigation. We call this graph entropy as the second-degree-based entropy. The present work aims to investigate the role of Id,2 in structure property modeling of molecules.
Keywords: QSPR analysis; chemical graph theory; entropy; molecular graph; topological index.
Conflict of interest statement
The authors declare no conflict of interest.
Figures
References
-
- Gutman I. Degree-based topological indices. Croat. Chem. Acta. 2013;86:351–361. doi: 10.5562/cca2294. - DOI
-
- Shannon C.E., Weaver W. The Mathematical Theory of Communication. University of Illinois Press; Urbana, IL, USA: 1949.
-
- Rashevsky N. Life, information theory, and topology. Bull. Math. Biophys. 1955;17:229–235. doi: 10.1007/BF02477860. - DOI
-
- Dehmer M. Information processing in complex networks: Graph entropy and information functionals. Appl. Math. Comput. 2008;201:82–94. doi: 10.1016/j.amc.2007.12.010. - DOI
-
- Cao S., Dehmer M., Kang Z. Network entropies based on independent sets and matchings. Appl. Math. Comput. 2017;307:265–270. doi: 10.1016/j.amc.2017.02.021. - DOI
LinkOut - more resources
Full Text Sources
Research Materials
Miscellaneous
