On the Upper Bound for the Number of Spanning Trees of a Connected Graph

Abstract

Das $[4]$, Feng et al. $[5]$, and Li et al. $[13]$ obtained upper bounds for the number of spanning trees of a connected graph. Using some ideas in $[4]$, $[5]$, and $[13]$ and other established results, we obtain new upper bounds for the number of spanning trees of a connected graph.