Skip to main content
Journal ArticleOPEN ACCESS

Sharp upper bounds for the number of spanning trees of a graph

Applicable Analysis and Discrete Mathematics (2008) 2(2) 255-259
DOI: 10.2298/AADM0802255F
13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This note presents two new upper bounds for the number of spanning trees of a graph in terms of the order, edge number and maximum degree of a graph.

Author supplied keywords

Cite

CITATION STYLE

APA

Feng, L., Yu, G., Jiang, Z., & Ren, L. (2008). Sharp upper bounds for the number of spanning trees of a graph. Applicable Analysis and Discrete Mathematics, 2(2), 255–259. https://doi.org/10.2298/AADM0802255F

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