Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization

Murali K. Srinivasan

The number of spanning trees of a graph $G$ is called the {\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\em (binary) hypercube} of dimension $n$. A classical…