Alexander polynomial and spanning trees
Geometric Topology
2020-07-09 v1
Abstract
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 gives the weighted number of the spanning trees of the graph.
Cite
@article{arxiv.2007.03826,
title = {Alexander polynomial and spanning trees},
author = {Yuanyuan Bao and Zhongtao Wu},
journal= {arXiv preprint arXiv:2007.03826},
year = {2020}
}
Comments
13 pages. Comments are welcome