English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formulafor the number of spanning trees of a graph in terms of the quantum relativeentropy between the maximally mixed state and another state specificallyobtained from the graph. We use properties of the quantum relative entropy toprove tight bounds for the number of spanning trees in terms of basicparameters like degrees and number of vertices.

Kirchhoff's Matrix‐Tree Theorem Revisited: Counting Spanning Trees with the Quantum Relative Entropy