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.