Title of article :
The number of spanning trees of a graph
Author/Authors :
Li، نويسنده , , Jianxi and Shiu، نويسنده , , Wai Chee and Chang، نويسنده , , An، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
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 :
spanning trees , graph , Bound
Journal title :
Applied Mathematics Letters
Journal title :
Applied Mathematics Letters
