On the characterization of graphs with maximum number of spanning trees

Discrete Mathematics

Volumn 179, Issue 1-3, 1998, Pages 155-166

  Petingi, L ^a   Boesch, F ^a   Suffel, C ^a  

^a Stevens Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041357086     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00034-4     Document Type: Article

References (10)

1. N. Biggs, Algebraic Graph Theory, Cambridge Univ. Press, Cambridge, 1974.
2. Boesch, Li, Suffel, On the exsitence of uniformly most reliable networks, Networks 21 (1991) 181-194.
3. Cvetovic, Doob, Sachs, Spectra of Graphs, Mathematics vol. 87, Academic Press, New York, 1980.
4. C. Cheng, Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimization design theory, J. Combin. Theory B 31, (1981) 240-248.
5. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1971.
6. A. Kelmans, V. Chelnokov, A certain polynomial of a graph and graphs with an extremal number of trees, J. Combin. Theory B 16 (1974) 197-214.
7. A. Kelmans, Comparisons of graphs by their number of spanning trees, Discrete Math. 16 (1976) 241-261.
8. R. Merris, Laplacian matrix of graphs: a survey, Linear Algebra Appl. 198 (1994) 143-176.
9. D. Shier, Maximizing the number of spanning trees in a graph with n nodes and m edges, J. Res. Nat. Bureau Standards 78 B (1974) 193-196.
10. Wang, A proof of Boesch's conjecture, Networks 24 (1994) 277-284.