{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:02:16Z","timestamp":1762444936195,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 30031"],"award-info":[{"award-number":["P 30031"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish connections between H-entropy and automorphisms of graphs. In particular, we determine the H-entropy of graphs whose automorphism group has exactly two orbits, and characterize some classes of graphs with zero H-entropy.<\/jats:p>","DOI":"10.3390\/sym11081013","type":"journal-article","created":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:09:08Z","timestamp":1565147348000},"page":"1013","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["The Hosoya Entropy of Graphs Revisited"],"prefix":"10.3390","volume":"11","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"}]},{"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1066-1809","authenticated-orcid":false,"given":"Jin","family":"Tao","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Automation, Aalto University, 02150 Espoo, Finland"},{"name":"College of Engineering, Peking University, Beijing 100871, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[{"name":"Predictive Medicine and Data Analytics Lab, Department of Signal Processing, Tampere University of Technology, 33720 Tampere, Finland"},{"name":"Institute of Biosciences and Medical Technology, 33520 Tampere, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"ref_1","unstructured":"Bonchev, D. (1983). Information Theoretic Indices for Characterization of Chemical Structures, Research Studies Press."},{"key":"ref_2","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_3","unstructured":"Dehmer, M. (2006). Strukturelle Analyse web-basierter Dokumente. Multimedia und Telekooperation, Deutscher Universitats Verlag."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Shi, Y., and Emmert-Streib, F. (2014). Structural differentiation of graphs using Hosoya-based indices. PLoS ONE, 9.","DOI":"10.1371\/journal.pone.0102459"},{"key":"ref_5","first-page":"i","article-title":"Nonlinear dynamics tools for solving problems coming from engineering, physics, chemistry, ecology and medicine","volume":"12","author":"Gao","year":"2019","journal-title":"Discret. Contin. Dyn. Syst. Ser. S"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.21042\/AMNS.2018.2.00034","article-title":"Convexity result and trees with large Balaban index","volume":"3","author":"Knor","year":"2018","journal-title":"Appl. Math. Nonlinear Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02476948","article-title":"Entropy and the complexity of the graphs I: An index of the relative complexity of a graph","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.3390\/e17031054","article-title":"The Hosoya entropy of a graph","volume":"17","author":"Mowshowitz","year":"2015","journal-title":"Entropy"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02477860","article-title":"Life, Information Theory, and Topology","volume":"17","author":"Rashevsky","year":"1955","journal-title":"Bull. Math. Biophys."},{"key":"ref_10","unstructured":"Shannon, C.E., and Weaver, W. (1949). The Mathematical Theory of Communication, University of Illinois Press."},{"key":"ref_11","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_12","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_13","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_14","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_15","first-page":"57","article-title":"A history of graph entropy measures","volume":"181","author":"Dehmer","year":"2011","journal-title":"Inf. Sci. Int. J."},{"key":"ref_16","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_17","first-page":"259","article-title":"Some properties on entropies of graphs","volume":"78","author":"Das","year":"2017","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02476692","article-title":"Entropy and the complexity of graphs II: The information content of digraphs and infinite graphs","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_19","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_20","doi-asserted-by":"crossref","unstructured":"Harary, F. (1969). Graph Theory, Addison-Wesley.","DOI":"10.21236\/AD0705364"},{"key":"ref_21","first-page":"88","article-title":"Hosoya entropy of fullerene graph","volume":"352","author":"Ghorbani","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"ref_22","unstructured":"Biggs, N. (1993). Algebraic Graph Theory, Cambridge University Press. [2nd ed.]."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., and Haemers, W.H. (2012). Spectra of Graphs, Springer.","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"ref_24","unstructured":"Imrich, W., and Klav\u017ear, S. (2000). Product Graphs: Structure and Recognition, John Wiley and Sons."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","article-title":"Structural determination of paraffin boiling points","volume":"69","author":"Wiener","year":"1947","journal-title":"J. Am. Chem. Soc."},{"key":"ref_26","first-page":"45","article-title":"Graph isomorphisms","volume":"730","author":"McKay","year":"1981","journal-title":"Congr. Numer."},{"key":"ref_27","first-page":"1","article-title":"The igraph software package for complex network research","volume":"1695","author":"Csardi","year":"2006","journal-title":"InterJournal Complex Syst."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/8\/1013\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:08:53Z","timestamp":1760188133000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/8\/1013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,6]]},"references-count":27,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2019,8]]}},"alternative-id":["sym11081013"],"URL":"https:\/\/doi.org\/10.3390\/sym11081013","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,8,6]]}}}