On graphs with the maximum number of spanning trees

Random Structures and Algorithms

Volumn 9, Issue 1, 1996, Pages 177-192

  Kelmans, Alexander K ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF PUERTO RICO   (Puerto Rico)

Author keywords

Characteristic polynomial; Eigenvalues of a matrix; Graph; Laplacian polynomial; Maximization problem; Number of spanning trees; Partial order; Random graph

Indexed keywords

EID: 21444452480     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2<177::AID-RSA11>3.0.CO;2-L     Document Type: Article

References (22)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, Amsterdam, 1976.
2. R. L. Brooks, C. A. B. Smith, A. H. Stone, and W. T. Tutte, Dissection of a rectangle into squares, Duke Math. J., 7, 312-340 (1940).
3. A. Cayley, A theorem on trees, Quart. J. Math., 23, 376-378 (1889).
4. C. Cheng, Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimization design theory, J. Combinat. Theor., B-31, 240-248 (1981).
5. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs, Academic, New York, 1980.
6. E. A. Dinic, A. K. Kelmans, and M. A. Zaitcev, Non-isomorphic trees with the same T-polynomials, Inf. Process. Lett., 6(3), 73-76 (1977).
7. M. Karoński, A review of random graphs, J. Graph Theor., 6, 349-389 (1982).
8. A. K. Kelmans, The number of trees of a graph I, II, Avtomat. Telemeh. 26, 2194-2204 (1965) [Automat. Remote Control, 27, 56-65 (1966)].
9. A. K. Kelmans, The number of trees of a graph I, II, Avtomat. Telemeh. 26, 2194-2204 (1965) [Automat. Remote Control, 27, 56-65 (1966)].
10. A. K. Kelmans, On properties of the characteristic polynomial of a graph, in Kibernetiku - Na Sluzbu Kommunizmu, 4, Gosenergoizdat, Moscow, 1967.
11. A. K. Kelmans and V. M. Chelnokov, Characteristic polynomials of graphs and their optimization, Proc. All-Union Workshop on Graph Theory, Vaivary, Latviiskiy Gos. Universitet, 1972.
12. A. K. Kelmans and V. M. Chelnokov, A certain polynomial of a graph and graphs with an external number of trees, J. Combinat. Theor., B-16, 197-214 (1974).
13. A. K. Kelmans, Comparison of graphs by their number of spanning trees, Discrete Math., 16, 241-261 (1976).
14. A. K. Kelmans, Operations on graphs that increase the number of their spanning trees, in Issledovanie po Discretnoy Optimizacii, Nauka, Moscow, 1976, pp. 406-424.
15. A. K. Kelmans, Comparison of graphs by their probability of connectivity, in Kombinator. Asympt. Analiz, Krasnoyarsk, 1977, pp. 69-81.
16. A. K. Kelmans, Graphs with an extremal number of spanning trees, J. Graph Theor., 4, 119-122 (1980).
17. A. K. Kelmans, On maximum reliable graphs, in Workshop on Applied Mathematics and Computers, Kiev, 1980.
18. A. K. Kelmans, On graphs with randomly deleted edges, Acta Math. Acad. Sci. Hung., 37(1-3), 259-267 (1981).
19. A. K. Kelmans and B. N. Kimelfeld, Multiplicative submodularity of a matrix's principal minor as a function of the set of the rows and some combinatorial applications. Discrete Math., 44, 113-116 (1983).
20. A. K. Kelmans, Operations on graphs increasing their Laplacian polynomials, RUTCOR Research Report 18-95, Rutgers University, New Brunswick, NJ, 1995, 1-17.
21. A. K. Kelmans, Comparison of graphs by their Laplacian polynomials, RUTCOR Research Report ??-95, Rutgers University, New Brunswick, NJ, 1995.
22. G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird, Ann. Phys. Chem., 72, 497-508 (1847).