The Hosoya Entropy of a Graph

Entropy

Abbe Mowshowitz²  Matthias Dehmer¹ 

[1] Department of Biomedical Computer Science and Mechatronics, UMIT, Eduard Wallnoefer Zentrum 1, A-6060, Hall in Tyrol, Austria; E-Mail:;Department of Computer Science, The City College of New York (CUNY), 138th Street at Convent Avenue, New York, NY 10031, USA

关键词: Hosoya entropy;    Hosoya polynomial;    partial Hosoya polynomial;    automorphism group;    orbit;    tree;   

DOI  :  10.3390/e17031054

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland