It is well-known that the number of spanning trees, denoted by $τ(G)$, in a connected multi-graph $G$ can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method to compute $τ(G)$ by degrees of vertices.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。