arXiv · 2007.03826
Alexander polynomial and spanning trees
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 $t=1$ gives the weighted number of the spanning trees of the graph.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yuanyuan Bao, Zhongtao Wu. 2020-07-07. Alexander polynomial and spanning trees. https://arxiv.org/abs/2007.03826
Cite the original work for its findings. Save a collection to share your selection of sources.