[1]
Li, Rao, “A new upper bound on the number of spanning trees of a graph”, A Canadian journal of applied mathematics, computer science and statistics, vol. 91, Jun. 2013.