Bozkurt, S. BurcuBozkurt, Durmus2020-03-262020-03-2620141537-744Xhttps://dx.doi.org/10.1155/2014/294038https://hdl.handle.net/20.500.12395/31040We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Delta(1)), minimum vertex degree (delta), first Zagreb index (M-1), and Randic index (R-1).en10.1155/2014/294038info:eu-repo/semantics/openAccessArticle24688378Q2WOS:000331823300001N/A