Journal ArticleOPEN ACCESS

On the number of spanning trees of graphs

The Scientific World Journal (2014) 2014
DOI: 10.1155/2014/294038
3Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

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 (M1), and Randić index (R-1). © 2014 Ş. Burcu Bozkurt and Durmuş Bozkurt.

Cite

CITATION STYLE

APA

Bozkurt, Ş. B., & Bozkurt, D. (2014). On the number of spanning trees of graphs. The Scientific World Journal, 2014. https://doi.org/10.1155/2014/294038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free