The Hosoya entropy of a graph (Q296523)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6593676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Hosoya entropy of a graph |
scientific article; zbMATH DE number 6593676 |
Statements
The Hosoya entropy of a graph (English)
0 references
15 June 2016
0 references
Summary: 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.
0 references
0 references
0 references
0.8096408247947693
0 references
0.8069303631782532
0 references
0.8022993803024292
0 references
