{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:43:08Z","timestamp":1760240588343,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:00:00Z","timestamp":1565827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to all graphs representing the isomers of octane. Taking into account the vertex degree as well (degree-ecc-entropy), we find a good correlation with the acentric factor of octane isomers. In particular, we compute the degree-ecc-entropy for three classes of dendrimer graphs.<\/jats:p>","DOI":"10.3390\/axioms8030098","type":"journal-article","created":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T11:11:00Z","timestamp":1565867460000},"page":"98","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Note on Distance-Based Entropy of Dendrimers"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5623-9932","authenticated-orcid":false,"given":"Modjtaba","family":"Ghorbani","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran 6785-136, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Dehmer","sequence":"additional","affiliation":[{"name":"Steyr School of Management, University of Applied Sciences Upper Austria, 4400 Steyr Campus, Austria"},{"name":"Department of Biomedical Computer Science and Mechatronics, UMIT, 6060 Hall in Tyrol, Austria"},{"name":"College of Artificial Intelligence, Nankai University, Tianjin 300350, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samaneh","family":"Zangi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran 6785-136, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8254-505X","authenticated-orcid":false,"given":"Abbe","family":"Mowshowitz","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The City College of New York (CUNY), New York, NY 10031, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[{"name":"Predictive Society and Data Analytics Lab, Department of Information Technology and Communication Sciences, Tampere University, 33720 Tampere, Finland"},{"name":"Institute of Biosciences and Medical Technology, Tampere University, 33520 Tampere, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,15]]},"reference":[{"key":"ref_1","first-page":"547","article-title":"Graph operations based on using distance-based graph entropies","volume":"333","author":"Ghorbani","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_2","first-page":"163","article-title":"On certain aspects of graph entropies of fullerenes","volume":"81","author":"Ghorbani","year":"2019","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_3","unstructured":"Gutman, I., and Furtula, B. (2008). Eccentric Connectivity Index of Fullerenes. Novel Molecular Structure Descriptors\u2013Theory and Applications II, MCM."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4517","DOI":"10.1063\/1.434593","article-title":"Information theory, distance matrix and molecular branching","volume":"67","author":"Bonchev","year":"1977","journal-title":"J. Chem. Phys."},{"key":"ref_5","first-page":"623","article-title":"Graph distance measures based on topological indices revisited","volume":"266","author":"Dehmer","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"ref_6","first-page":"39","article-title":"A new method of measuring similarity for a special class of directed graphs","volume":"36","author":"Dehmer","year":"2007","journal-title":"Tatra Mt. Math. Publ."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/cplx.20379","article-title":"Generalized graph entropies","volume":"17","author":"Dehmer","year":"2011","journal-title":"Complexity"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Mowshowitz, A., and Emmert-Streib, F. (2011). Connections between classical and parametric network entropies. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0015733"},{"key":"ref_9","first-page":"147","article-title":"Uniquely discriminating molecular structures using novel eigenvalue-based descriptors","volume":"67","author":"Dehmer","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_10","unstructured":"Dehmer, M. (2006). Strukturelle Analyse web-basierter Dokumente. Multimedia und Telekooperation, Deutscher Universit\u00e4ts Verlag, Springer."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1021\/ci900060x","article-title":"On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures","volume":"49","author":"Dehmer","year":"2009","journal-title":"J. Chem. Inf. Model."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Gutman, I., Furtula, B., and Katani\u0107, V. (2018). Randi\u0107 index and information. AKCE Int. J. Graphs Comb., 18.","DOI":"10.1016\/j.akcej.2017.09.006"},{"key":"ref_13","first-page":"69","article-title":"Entropy of weighted graphs with the degree-based topological indices as weights","volume":"76","author":"Kazemi","year":"2016","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_14","first-page":"470","article-title":"Novel inequalities for generalized graph entropies graph energies and topological indices","volume":"259","author":"Li","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Emmert-Streib, F., and Shi, Y. (2014). Interrelations of graph distance measures based on topological indices. PLoS ONE, 9.","DOI":"10.1371\/journal.pone.0094985"},{"key":"ref_16","unstructured":"Shannon, C.E., and Weaver, W. (1949). The Mathematical Theory of Communication, University of Illinois Press."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3250301","DOI":"10.1155\/2017\/3250301","article-title":"On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy","volume":"2017","author":"Morzy","year":"2017","journal-title":"Complexity"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"012308","DOI":"10.1103\/PhysRevE.96.012308","article-title":"Low-algorithmic-complexity entropy-deceiving graphs","volume":"96","author":"Zenil","year":"2017","journal-title":"Phys. Rev. E"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Aslam, A., Nadeem, M.F., Zahid, Z., Zafar, S., and Gao, W. (2019). Computing certain topological indices of the line graphs of subdivision graphs of some rooted product graphs. Mathematics, 7.","DOI":"10.3390\/math7050393"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1515\/chem-2019-0029","article-title":"Calculating topological indices of certain OTIS Interconnection networks","volume":"17","author":"Aslam","year":"2019","journal-title":"Open Chem."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bonchev, D., and Buck, G.A. (2005). Quantitative measures of network complexity. Complexity in Chemistry, Biology, and Ecology, Springer.","DOI":"10.1007\/b136300"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"76806","DOI":"10.1109\/ACCESS.2019.2920882","article-title":"Remarks on multiplicative atom-bond connectivity index","volume":"7","author":"Dimitrov","year":"2019","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Zenil, H., Kiani, N.A., and Tegn\u00e9r, J. (2018). A Review of graph and network complexity from an algorithmic information perspective. Entropy, 20.","DOI":"10.3390\/e20080551"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1850005","DOI":"10.1142\/S0129626418500056","article-title":"Algorithmic complexity and reprogrammability of chemical structure networks","volume":"28","author":"Zenil","year":"2018","journal-title":"Parallel Process. Lett."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/8\/3\/98\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:11:25Z","timestamp":1760188285000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/8\/3\/98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,15]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["axioms8030098"],"URL":"https:\/\/doi.org\/10.3390\/axioms8030098","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2019,8,15]]}}}