Improved bounds for the number of spanning trees of graphs

Abstract

For a given a simple connected graph, we present some new bounds via a new approach for the numberof spanning trees. Usage this approach presents an advantage not only to derive old and new bounds on this topicbut also gives an idea how some previous results in similar area can be developed.