基尔霍夫矩阵树定理的再认识：用量子相对熵计算生成树
The Kirchhoff's Matrix-Tree Theorem revisited: counting spanning trees with the quantum relative entropy
摘要：
通过重新讨论Kirchhoff矩阵树定理，我们给出了一个图的生成树个数的精确公式，它是由图的最大混合态与另一个态之间的量子相对熵来表示的.我们使用量子相对熵的性质来证明紧边界的基本参数，如度和顶点数的生成树的数量。
英文摘要：
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from the graph. We use properties of the quantum relative entropy to prove tight bounds for the number of spanning trees in terms of basic parameters like degrees and number of vertices.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
