A sharp upper bound for the number of spanning trees of a graph

Graphs and Combinatorics

Volumn 23, Issue 6, 2007, Pages 625-632

  Das, Kinkar Ch ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Graph; Laplacian matrix; Spanning trees

Indexed keywords

EID: 36949011039     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-007-0758-4     Document Type: Article

References (11)

1. Anderson, W.N., Morley, T.D.: Eigenvalues of the Laplacian of a graph, Linear and Multilinear Algebra 18, 141-145 (1985)
2. Cvetkovic', D.M., Doob, M., Sachs, H.: Spectra of graphs, Mathematics 87, Academic press, 1980
3. Das, K.C.: The Laplacian Spectrum of a Graph, Computers and Mathematics with Appl. 48, 715-724 (2004)
4. Das, K.C.: A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs, Linear Algebra Appl. 376, 173-186 (2004)
5. Grimmett, G.R.: An upper bound for the number of spanning trees of a graph, Discrete Math. 16, 323-324 (1976)
6. Grone, R., Merris, R.: A bound for the complexity of a simple graph, Discrete Math. 69, 97-99 (1988)
7. *, SIAM J. Discrete Math. 7 (2), 221-229 (1994)
8. Grone, R., Zimmermann, G.: Large eigenvalues of the Laplacian, Linear and Multilinear Algebra 28, 45-47 (1990)
9. Li, J.-S., Pan, Y.-L.: A note on the second largest eigenvalue of the Laplacian matrix of a graph, Linear and Multilinear Algebra 48, 117-121 (2000)
10. Merris, R.: Laplacian matrices of graphs: A survey, Linear Algebra Appl. 197, 198, 143-176 (1994)
11. Nosal, E.: Eigenvalues of Graphs, Master Thesis, University of Calgary, 1970