{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:16:59Z","timestamp":1760217419064,"version":"build-2065373602"},"reference-count":21,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T00:00:00Z","timestamp":1425513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity based on a decomposition of the vertices linked to partial Hosoya polynomials. Connections between the information content of a graph and Hosoya entropy are established, and the special case of Hosoya entropy of trees is investigated.<\/jats:p>","DOI":"10.3390\/e17031054","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T10:43:07Z","timestamp":1425552187000},"page":"1054-1062","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["The Hosoya Entropy of a Graph"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8254-505X","authenticated-orcid":false,"given":"Abbe","family":"Mowshowitz","sequence":"first","affiliation":[{"name":"Department of Computer Science, The City College of New York (CUNY), 138th Street at Convent Avenue, New York, NY 10031, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Dehmer","sequence":"additional","affiliation":[{"name":"Department of Biomedical Computer Science and Mechatronics, UMIT, Eduard Wallnoefer Zentrum 1, A-6060, Hall in Tyrol, Austria"},{"name":"Department of Computer Science, Universit\u00e4t der Bundeswehr M\u00fcnchen, Werner Heisenberg Weg 39, D-85579 Neubiberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,3,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A History of Graph Entropy Measures","volume":"181","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Mowshowitz, A., and Shi, Y. (2014). Structural Differentiation of Graphs Using Hosoya-Based Indices. PLoS ONE., 9.","DOI":"10.1371\/journal.pone.0102459"},{"key":"ref_3","unstructured":"Bonchev, D. (1983). Information Theoretic Indices for Characterization of Chemical Structures, Research Studies Press."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1049\/iet-syb.2010.0025","article-title":"Networks for Systems Biology: Conceptual Connection of Data and Function","volume":"5","author":"Dehmer","year":"2011","journal-title":"IET Syst. Biol."},{"key":"ref_5","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_6","doi-asserted-by":"crossref","unstructured":"Todeschini, R. (2011). The j-index: A new bibliometric index and multivariate comparisons between other common indices. Scientometrics, in press.","DOI":"10.1007\/s11192-011-0346-5"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1021\/ci00015a010","article-title":"Symmetry of Chemical Structures: A Novel Method of Graph Automorphism Group Determination","volume":"33","author":"Bohanec","year":"1993","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1021\/ci00021a021","article-title":"Computer Generation of Automorphism Groups of Weighted Graphs","volume":"34","author":"Balasubramanian","year":"1994","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1021\/ci0341868","article-title":"Molecular Symmetry Perception","volume":"44","author":"Ivanov","year":"2004","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1021\/ci00006a006","article-title":"Automorphism and Equivalence Classes","volume":"32","author":"Figueras","year":"1992","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_11","unstructured":"Allen, E.B., and Measuring, Graph (June, January 4). Abstractions of Software: An Information-Theory Approach, Ottawa, Ontario, Canada."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Emmert-Streib, F., and Mehler, A. (2011). Towards an Information Theory of Complex Networks: Statistical Methods and Applications, Birkh\u00e4user.","DOI":"10.1007\/978-0-8176-4904-3"},{"key":"ref_13","first-page":"140","article-title":"A Network-Based Approach to Classify the Three Domains of Life","volume":"6","author":"Kugler","year":"2011","journal-title":"Biol. Direct."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(88)90017-0","article-title":"On Some Counting Polynomials","volume":"19","author":"Hosoya","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"ref_15","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_16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.26493\/1855-3974.15.895","article-title":"Vertex-weighted Wiener polynomials for composite graphs","volume":"1","year":"2008","journal-title":"Ars Math. Contemp."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2298\/FIL0903103H","article-title":"Wiener-type invariants of some graph operations","volume":"23","author":"Zadeh","year":"2009","journal-title":"Filomat"},{"key":"ref_18","unstructured":"Bonchev, D., and Rouvray, D.H. (1991). Chemical Graph Theory: Introduction and Fundamentals, Abacus Press."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"e102459","DOI":"10.1371\/journal.pone.0102459","article-title":"Structural Differentiation of Graphs Using Hosoya-Based Indices","volume":"9","author":"Dehmer","year":"2014","journal-title":"PLoS ONE"},{"key":"ref_20","first-page":"239","article-title":"Herstellung von Graphen mit vorgegebener abstrakter Gruppe","volume":"6","author":"Frucht","year":"1938","journal-title":"Compos. Math."},{"key":"ref_21","unstructured":"Prins, G. (1957). The Automorphism Group of a Tree. [Ph.D. Thesis, University of Michigan]."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/3\/1054\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:43:10Z","timestamp":1760215390000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/3\/1054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,5]]},"references-count":21,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2015,3]]}},"alternative-id":["e17031054"],"URL":"https:\/\/doi.org\/10.3390\/e17031054","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2015,3,5]]}}}