论文标题
亚历山大多项式和跨越树木
Alexander polynomial and spanning trees
论文作者
论文摘要
受作者早期作品中的组合结构的启发，将经典的亚历山大多项式概括为边缘平衡重量的大量空间图，我们表明，亚历山大多项式评估在$ t = 1 $中的值给出了图表的加权树的加权数。
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.
