The number of spanning trees of a graph

Applied Mathematics Letters

Volumn 23, Issue 3, 2010, Pages 286-290

  Li, Jianxi ^a   Shiu, Wai Chee ^a   Chang, An ^b  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b FUZHOU UNIVERSITY   (China)

Author keywords

Bound; Graph; Spanning trees

Indexed keywords

CHROMATIC NUMBER; CONNECTED GRAPH; MINIMUM VERTEX DEGREE; SPANNING TREE; STRUCTURAL PARAMETER; UPPER BOUND; VERTEX DEGREE;

GRAPH THEORY;

EID: 70449672297     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2009.10.006     Document Type: Article

References (11)

1. Bondy J., and Murty U. Graph Theory with Applications (1976), MacMillan, New York
2. Cheng C. Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimization design theory. J. Combinat. Theory B-31 (1981) 240-248
3. Godsil C., and Royle G. Algebraic graph theory. Graduate Texts in Mathematics 207 (2001), Springer-Verlag, New York
4. Grone R., and Merris R. The Laplacian spectrum of a graph. SIAM J. Discrete Math. 7 (1994) 221-229
5. Merris R. Laplacian graph eigenvectors. Linear Algebra Appl. 278 (1998) 221-236
6. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23 (1973) 298-305
7. Kirkland S. A bound on algebraic connectivity of a graph in terms of the number of cutpoints. Linear Multilinear Algebra 47 (2000) 93-103
8. Li J., and Fan Y. Note on the algebraic connectivity of a graph. J. Univ. Sci. Technol. China. 32 (2002) 1-6
9. Das K. A sharp upper bound for the number of spanning trees of a graph. Graphs Combin. 23 (2007) 625-632
10. Grimmett G. An upper bound for the number of spanning trees of a graph. Discrete Math. 16 (1976) 323-324
11. Feng L., Yu G., Jiang Z., and Ren L. Sharp upper bounds for the number of spanning trees of a graph. Appl. Anal. Discrete Math. 2 (2008) 255-259