On the number of spanning trees of graphs

S Burcu Bozkurt; Durmuş Bozkurt

doi:10.1155/2014/294038

On the number of spanning trees of graphs

ScientificWorldJournal. 2014 Feb 10:2014:294038. doi: 10.1155/2014/294038. eCollection 2014.

Authors

S Burcu Bozkurt¹, Durmuş Bozkurt¹

Affiliation

¹ Department of Mathematics, Science Faculty, Selçuk University, Alaeddin Keykubat Campus, 42075 Konya, Turkey.

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).

Publication types

Research Support, Non-U.S. Gov't

MeSH terms

Algorithms*
Computer Simulation
Models, Theoretical*
Numerical Analysis, Computer-Assisted*