The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees

Recently, Zheng and Wu defined the concept of odd spanning tree of a graph, meaning a spanning tree in which every vertex has odd degree. Similar to Cayley’s formula, Feng, Chen and Wu counted the number of odd spanning trees in complete graphs via Prüfer code and the exponential generating function. In this note, we give a simple proof via a classical spanning tree enumeration formula and the Boolean function.We also generalize it to complete bipartite graphs.