| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709822 | Applied Mathematics Letters | 2010 | 5 Pages |
Abstract
In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Jianxi Li, Wai Chee Shiu, An Chang,