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.
|Number of pages||5|
|Journal||Applied Mathematics Letters|
|Publication status||Published - Mar 2010|
Scopus Subject Areas
- Applied Mathematics
- Spanning trees