Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory
- 1 October 1981
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 31 (2), 240-248
- https://doi.org/10.1016/s0095-8956(81)80028-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Optimality of Certain Asymmetrical Experimental DesignsThe Annals of Statistics, 1978
- Maximizing the number of spanning trees in a graph with n nodes and m edgesJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1974
- A certain polynomial of a graph and graphs with an extremal number of treesJournal of Combinatorial Theory, Series B, 1974
- On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical DesignsThe Annals of Mathematical Statistics, 1958