The Hosoya Entropy of a Graph
Department of Computer Science, The City College of New York (CUNY), 138th Street at Convent Avenue, New York, NY 10031, USA
Department of Biomedical Computer Science and Mechatronics, UMIT, Eduard Wallnoefer Zentrum 1, A-6060, Hall in Tyrol, Austria
Department of Computer Science, Universität der Bundeswehr München, Werner Heisenberg Weg 39, D-85579 Neubiberg, Germany
Author to whom correspondence should be addressed.
Academic Editor: J. A. Tenreiro Machado
Received: 10 February 2015 / Revised: 2 March 2015 / Accepted: 2 March 2015 / Published: 5 March 2015
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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Mowshowitz, A.; Dehmer, M. The Hosoya Entropy of a Graph. Entropy 2015, 17, 1054-1062.
Mowshowitz A, Dehmer M. The Hosoya Entropy of a Graph. Entropy. 2015; 17(3):1054-1062.
Mowshowitz, Abbe; Dehmer, Matthias. 2015. "The Hosoya Entropy of a Graph." Entropy 17, no. 3: 1054-1062.
Show more citation formats
Show less citations formats
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.