The Hosoya entropy of a graph (Q296523)

From MaRDI portal
Revision as of 04:39, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(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

    title
    The Hosoya entropy of a graph (English)
    0 references
    author
    Abbe Mowshowitz
    0 references
    Matthias Dehmer
    0 references
    published in
    Entropy
    0 references
    publication date
    15 June 2016
    0 references
    review text
    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

    DOI
    10.3390/e17031054
    0 references
    zbMATH DE Number
    6593676
    0 references
    OpenAlex ID
    W2053600926
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q296523&oldid=36256763"
    Powered by MediaWiki