Inspired by the combinatorial constructions in earlier work of the authors that generalized the classical Alexander polynomial to a large class of spatial graphs with a balanced weight on edges, we show that the value of the Alexander polynomial evaluated at t = 1 gives the weighted number of the spanning trees of the graph.

中文翻译：

---

亚历山大多项式和生成树

受作者早期工作中的组合结构的启发，将经典亚历山大多项式推广到一大类边缘权重平衡的空间图，我们表明亚历山大多项式的值评估为吨 = 1给出图的生成树的加权数.