The Hosoya entropy of a graph (Q296523): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.3390/e17031054 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.3390/E17031054 / rank | |||
Normal rank | |||
Revision as of 15:54, 8 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Hosoya entropy of a graph |
scientific article |
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
