title: On the number of spanning trees of graphs.
abstract: We 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 (Δ1), minimum vertex degree (δ), first Zagreb index (M 1), and Randić index (R -1).
authors.affiliation: Department of Mathematics, Science Faculty, Selçuk University, Alaeddin Keykubat Campus, 42075 Konya, Turkey.
authors.forename: S Burcu
authors.identifier: 0000-0001-9727-6107
authors.initials: SB
authors.lastname: Bozkurt
authors.affiliation: Department of Mathematics, Science Faculty, Selçuk University, Alaeddin Keykubat Campus, 42075 Konya, Turkey.
authors.forename: Durmuş
authors.initials: D
authors.lastname: Bozkurt
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008962:Models, Theoretical; D009716:Numerical Analysis, Computer-Assisted