The Hosoya entropy of a graph (Q296523)

From MaRDI portal
Revision as of 13:42, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





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
    0 references
    0 references
    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

    Identifiers